Closeness centrality in some splitting networks
A central issue in the analysis of complex networks is the assessment of their robustness and vulnerability. A variety of measures have been proposed in the literature to quantify the robustness of networks, and a number of graph-theoretic parameters have been used to derive formulas for calculating...
Main Authors: | Vecdi Aytac, Tufan Turaci |
---|---|
Format: | Article |
Language: | English |
Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2018-11-01
|
Series: | Computer Science Journal of Moldova |
Subjects: | |
Online Access: | http://www.math.md/files/csjm/v26-n3/v26-n3-(pp251-269).pdf |
Similar Items
-
On agglomeration-based rupture degree in networks and a heuristic algorithm
by: Ağtaş Muammer, et al.
Published: (2023-08-01) -
Computing closeness for some graphs
by: Tunçel Gölpek Hande, et al.
Published: (2023-12-01) -
Antimagic Labeling of Some Degree Splitting Graphs
by: Chirag Barasara, et al.
Published: (2023-12-01) -
Network bipartitioning in the anti-communicability Euclidean space
by: Jesús Gómez-Gardeñes, et al.
Published: (2021-11-01) -
Complexity of Some Duplicating Networks
by: Mohamed R. Zeen El Deen, et al.
Published: (2021-01-01)