Smallest graphs with distinct singleton centers
Bibliographic Data
| ID | 6161362 |
|---|---|
| Authors | Ulrik Brandes (0000-0002-1520-0430, University of Konstanz), Jan Hildenbrand (University of Konstanz) |
| Year | 2014 |
| Volume | 2 |
| Issue | 3 |
| Pages | 416-418 |
| Publication date | 2014-11-20 |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Network Science (JOURNAL) |
| Journal identifiers | ISSN: 2050-1250 • E-ISSN: 2050-1242 |
| Publisher | Cambridge University Press (PUBLISHER • US) |
| DOI | 10.1017/nws.2014.25 |
| OpenAlex | W2000606709 |
| Language | EN |
| References cited | 3 |
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
Betweenness centrality · Biology · Centrality · Closeness · Combinatorics · Epistemology · Operationalization · Singleton · Complex Network Analysis Techniques · Computer Science · Graph theory and applications · Mathematics · Philosophy
| Highly cited | No |
|---|