Smallest graphs with distinct singleton centers

Brandes, Ulrik; Hildenbrand, Jan

doi:10.1017/nws.2014.25

Smallest graphs with distinct singleton centers

Publikationstyp:	Zeitschriftenartikel
URI (zitierfähiger Link):	http://nbn-resolving.de/urn:nbn:de:bsz:352-0-277862
Autor/innen:	Brandes, Ulrik; Hildenbrand, Jan
Erscheinungsjahr:	2014
Erschienen in:	Network Science ; 2 (2014), 3. - S. 416-418. - ISSN 2050-1242. - eISSN 2050-1250
DOI (zitierfähiger Link):	https://dx.doi.org/10.1017/nws.2014.25
Zusammenfassung:	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.
Fachgebiet (DDC):	004 Informatik
Link zur Lizenz:	Nutzungsbedingungen
Universitätsbibliographie:	Ja
Dieser Beitrag ist im Zusammenhang des Rechteinhabers aufgrund einer (DFG-geförderten) Allianz- bzw. Nationallizenz frei zugänglich.

Zitieren

Dateien zu dieser Ressource

Name: Brandes_0-277862.pdf

Größe: 319.0Kb

Format: PDF

Öffnen

Prüfsumme: MD5:c2d2a33b24ae38e33cd464a6e59dc320

BRANDES, Ulrik, Jan HILDENBRAND, 2014. Smallest graphs with distinct singleton centers. In: Network Science. 2(3), pp. 416-418. ISSN 2050-1242. eISSN 2050-1250. Available under: doi: 10.1017/nws.2014.25

@article{Brandes2014Small-30373, title={Smallest graphs with distinct singleton centers}, year={2014}, doi={10.1017/nws.2014.25}, number={3}, volume={2}, issn={2050-1242}, journal={Network Science}, pages={416--418}, author={Brandes, Ulrik and Hildenbrand, Jan} }

terms-of-use Hildenbrand, Jan Brandes, Ulrik 2015-03-18T09:28:51Z eng 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. Hildenbrand, Jan 2014 Smallest graphs with distinct singleton centers Brandes, Ulrik 2015-03-18T09:28:51Z