On centrality functions of a graph

5Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

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.

Cited by Powered by Scopus

Centrality measure in graphs

54Citations
N/AReaders
Get full text

Robustness and resilience

45Citations
N/AReaders
Get full text

Network positions

29Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Kishi, G. (1981). On centrality functions of a graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 108 LNCS, pp. 45–52). Springer Verlag. https://doi.org/10.1007/3-540-10704-5_5

Readers over time

‘10‘12‘13‘14‘15‘16‘1702468

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 4

50%

Professor / Associate Prof. 2

25%

Lecturer / Post doc 1

13%

Researcher 1

13%

Readers' Discipline

Tooltip

Computer Science 4

50%

Social Sciences 2

25%

Agricultural and Biological Sciences 1

13%

Mathematics 1

13%

Save time finding and organizing research with Mendeley

Sign up for free
0