Abstract
For a connected nondirected graph, a centrality function is a real valued function of the vertices defined as a linear combination of the numbers of the vertices classified according to the distance from a given vertex. Some fundamental properties of the centrality functions and the set of central vertices are summarized. Inserting an edge between a center and a vertex, the stability of the set of central vertices are investigated.
For a weakly connected directed graph, we can prove similar theorems with respect to a generalized centrality function based on a new definition of the modified distance from a vertex to another vertex.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Christofides, N.: "Graph theory, an algorithmic approach", Academic Press, London, 1975
Sabidussi, G.: "The centrality index of a graph", Theory of graphs, International Symposium, Rome, pp. 369–372, 1966
Kajitani, Y. and Maruyama, T.: "Functional extention of centrality in a graph", Trans. IECE Japan, vol. 59, pp. 531–538, July 1976 (in Japanese)
Kishi, G. and Takeuchi, M.: "On centrality functions of a non-directed graph", Proc. of the 6th Colloq. on Microwave Comm., Budapest, Aug. 1978
Kajitani, Y.: "Centrality of vertices in a graph", Proc. 1979 International Colloq. on Circuits & Systems, Taipei, July 1979
Kishi, G. and Takeuchi, M.: "Centrality functions of directed graphs", Tech. Rep. CST 77–106, Technical Group on Circuit and System Theory, IECE Japan, Dec. 1977 (in Japanese)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kishi, G. (1981). On centrality functions of a graph. In: Saito, N., Nishizeki, T. (eds) Graph Theory and Algorithms. Lecture Notes in Computer Science, vol 108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10704-5_5
Download citation
DOI: https://doi.org/10.1007/3-540-10704-5_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10704-0
Online ISBN: 978-3-540-38661-2
eBook Packages: Springer Book Archive