Chavdar Dangalchev
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Latest Publications
- 1 January 2024
- Published by World Scientific Pub Co Pte Ltd in Computing Open
- Vol. 02
Closeness of Some Graph Operations
Closeness is an important measure of network centrality. In this paper, we will calculate the closeness of graphs, created by using operations on graphs. We will prove a formula for the closeness of shadow graphs. We will calculate the closeness of line graphs of some well-known graphs (like path, star, cycle, and complete graphs) and the closeness of line graphs of two of these graphs, connected by a bridge (like lollipop, tadpole, broom, and bistar graphs).
- 1 January 2024
- Published by World Scientific Pub Co Pte Ltd in Computing Open
- Vol. 02
Closeness of Some Graph Operations
Closeness is an important measure of network centrality. In this paper, we will calculate the closeness of graphs, created by using operations on graphs. We will prove a formula for the closeness of shadow graphs. We will calculate the closeness of line graphs of some well-known graphs (like path, star, cycle, and complete graphs) and the closeness of line graphs of two of these graphs, connected by a bridge (like lollipop, tadpole, broom, and bistar graphs).
- Open Access
Closeness of Some Graph Operations
Closeness is an important measure of network centrality. In this article we will calculate the closeness of graphs, created by using operations on graphs. We will prove a formula for the closeness of shadow graphs. We will calculate the closeness of line graphs of some wellknown graphs (like path, star, cycle, and complete graphs) and the closeness of line graphs of two of these graphs, connected by a bridge (like lollipop, tadpole, broom, and bistar graphs).
Open AccessCloseness of Some Graph Operations
Closeness is an important measure of network centrality. In this article we will calculate the closeness of graphs, created by using operations on graphs. We will prove a formula for the closeness of shadow graphs. We will calculate the closeness of line graphs of some wellknown graphs (like path, star, cycle, and complete graphs) and the closeness of line graphs of two of these graphs, connected by a bridge (like lollipop, tadpole, broom, and bistar graphs).
- Open Access
Closeness Centralities of Lollipop Graphs
Closeness is one of the most studied characteristics of networks. Residual closeness is a very sensitive measure of graphs robustness. Additional closeness is a measure of growth potentials of networks. In this article we calculate the closeness, vertex residual closeness, link residual closeness, and additional closeness of lollipop graphs.
Open AccessCloseness Centralities of Lollipop Graphs
Closeness is one of the most studied characteristics of networks. Residual closeness is a very sensitive measure of graphs robustness. Additional closeness is a measure of growth potentials of networks. In this article we calculate the closeness, vertex residual closeness, link residual closeness, and additional closeness of lollipop graphs.
- 10 June 2022
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 33 (08) , 1033-1052
Additional Closeness of Cycle Graphs
The additional closeness is a very important characteristic of graphs. It measures the maximal closeness of a graph after adding a new link and it is an indication of the growth potential of graphs’ closeness. Most of the time calculating the additional closeness requires solving nontrivial optimization problems. In this article, the additional closenesses of cycles, gear, and some other graphs are calculated. Bounds for additional closeness of graphs are discussed.
- 10 June 2022
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 33 (08) , 1033-1052
Additional Closeness of Cycle Graphs
The additional closeness is a very important characteristic of graphs. It measures the maximal closeness of a graph after adding a new link and it is an indication of the growth potential of graphs’ closeness. Most of the time calculating the additional closeness requires solving nontrivial optimization problems. In this article, the additional closenesses of cycles, gear, and some other graphs are calculated. Bounds for additional closeness of graphs are discussed.
- 28 May 2020
- Published by Prof. Marin Drinov Publishing House of BAS (Bulgarian Academy of Sciences)
- Vol. 73 (4) , 461-466
Closeness of Splitting Graphs
- 28 May 2020
- Published by Prof. Marin Drinov Publishing House of BAS (Bulgarian Academy of Sciences)
- Vol. 73 (4) , 461-466
Closeness of Splitting Graphs
- 6 August 2018
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 162 (1) , 1-15
Residual Closeness of Generalized Thorn Graphs
One of the most sensitive characteristics of network vulnerability is residual closeness. Calculating the closeness and the residual closeness of larger graphs is a time consuming and operations heavy process. In this article, we try to mitigate the
- 6 August 2018
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 162 (1) , 1-15
Residual Closeness of Generalized Thorn Graphs
One of the most sensitive characteristics of network vulnerability is residual closeness. Calculating the closeness and the residual closeness of larger graphs is a time consuming and operations heavy process. In this article, we try to mitigate the
- 1 December 2011
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 22 (08) , 1939-1948
RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS
In the last few years a new definition for closeness has been established because of the ability to measure not connected graphs and the possibility to create convenient formulas for calculations. Based on this definition a new, more sensitive measure for network vulnerability is created - residual closeness. The residual closeness utilizes closeness received after the removal of a link or a vertex and its links. In this article some formulas for easy calculation of residual closeness are given. The definition for closeness is generalized and its properties are explored.
- 1 December 2011
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 22 (08) , 1939-1948
RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS
In the last few years a new definition for closeness has been established because of the ability to measure not connected graphs and the possibility to create convenient formulas for calculations. Based on this definition a new, more sensitive measure for network vulnerability is created - residual closeness. The residual closeness utilizes closeness received after the removal of a link or a vertex and its links. In this article some formulas for easy calculation of residual closeness are given. The definition for closeness is generalized and its properties are explored.
- 1 June 2006
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 365 (2) , 556-564
Residual closeness in networks
- 1 June 2006
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 365 (2) , 556-564
Residual closeness in networks
- Open Access
- 1 July 2004
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 338 (3-4) , 659-671
Generation models for scale-free networks
- 1 July 2004
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 338 (3-4) , 659-671
Open AccessGeneration models for scale-free networks