Hostname: page-component-745bb68f8f-lrblm Total loading time: 0 Render date: 2025-02-11T09:01:59.044Z Has data issue: false hasContentIssue false

Smallest graphs with distinct singleton centers*

Published online by Cambridge University Press:  20 November 2014

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)
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
End Note
Copyright
Copyright © Cambridge University Press 2014 

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), 324369.CrossRefGoogle Scholar
McKay, B. D., & Piperno, A. (2014). Practical graph isomorphism, II. Journal of Symbolic Computation, 60, 94112.CrossRefGoogle Scholar
Todeschini, R., & Consonni, V. (2009). Molecular descriptors for chemoinformatics. (2nd ed.). Wiley-VCH.CrossRefGoogle Scholar