Eccentricity of Networks with Structural Constraints
The eccentricity of a node v in a network is the maximum distance from v to any other node. In social networks, the reciprocal of eccentricity is used as a measure of the importance of a node within a network. The associated centralization measure then calculates the degree to which a network is dom...
Main Authors: | Krnc Matjaž, Sereni Jean-Sébastien, Škrekovski Riste, Yilma Zelealem B. |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2020-11-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2180 |
Similar Items
-
On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs
by: Czap Július, et al.
Published: (2016-02-01) -
Existence of Regular Nut Graphs for Degree at Most 11
by: Fowler Patrick W., et al.
Published: (2020-05-01) -
Comparing Eccentricity-Based Graph Invariants
by: Hua Hongbo, et al.
Published: (2020-11-01) -
On Double-Star Decomposition of Graphs
by: Akbari Saieed, et al.
Published: (2017-08-01) -
Lack of Gromov-hyperbolicity in small-world networks
by: Shang Yilun
Published: (2012-06-01)