Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-09T09:13:13.564Z 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.

Information

Type
End Note
Copyright
Copyright © Cambridge University Press 2014