Hostname: page-component-7dd5485656-s6l46 Total loading time: 0 Render date: 2025-10-30T20:59:33.586Z Has data issue: false hasContentIssue false
  • English
  • Français

Smallest graphs with distinct singleton centers*

Published online by Cambridge University Press:  20 November 2014

ULRIK BRANDES  and
JAN HILDENBRAND
ULRIK BRANDES
Affiliation:
Department of Computer and Information Science, University of Konstanz, Konstanz, Germany (e-mail: ulrik.brandes@uni-konstanz.de, jan.hildenbrand@uni-konstanz.de)
JAN HILDENBRAND
Affiliation:
Department of Computer and Information Science, University of Konstanz, Konstanz, Germany (e-mail: ulrik.brandes@uni-konstanz.de, jan.hildenbrand@uni-konstanz.de)
Get access Rights & Permissions [Opens in a new window]

Extract

An incredible number of centrality indices has been proposed to date (Todeschini & Consonni, 2009). Four of them, however, can be considered prototypical because they operationalize distinct concepts of centrality and together cover the bulk of analyses and empirical uses: degree, closeness, betweenness, and eigenvector centrality.

Information

Type
End Note
Information
Network Science , Volume 2 , Issue 3 , December 2014 , pp. 416 - 418
Copyright
Copyright © Cambridge University Press 2014 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Footnotes

*

We are grateful to Martin Everett, David Krackhardt, and Stanley Wasserman for comments and suggestions. This research was partially supported by DFG under grant Br 2158/6-1.

References

Borgatti, S. P. (1999). Four distinct aspects of centrality. Connections, 22 (1), 130.Google Scholar
Krackhardt, D. (1990). Assessing the political landscape: Structure, cognition, and power in organizations. Administrative Science Quarterly, 35 (2), 324–369.CrossRefGoogle Scholar
McKay, B. D., & Piperno, A. (2014). Practical graph isomorphism, II. Journal of Symbolic Computation, 60, 94–112.CrossRefGoogle Scholar
Todeschini, R., & Consonni, V. (2009). Molecular descriptors for chemoinformatics. (2nd ed.). Wiley-VCH.CrossRefGoogle Scholar