Degree Centrality
Reference work entry
DOI: https://doi.org/10.1007/978-1-4419-9863-7_935
Definition
Degree centrality is defined as the number of links incident upon a node (i.e., the number of ties that a node has). If the network is directed (meaning that ties have direction), then two separate measures of degree centrality are defined, namely, indegree and outdegree. Indegree is a count of the number of ties directed to the node (head endpoints) and outdegree is the number of ties that the node directs to others (tail endpoints). In such cases, the degree is the sum of indegree and outdegree.
Cross-References
References
- Bang-Jensen J, Gutin G (2007) Digraphs: theory, algorithms and applications, 1st edn. Springer, LondonGoogle Scholar
- Diestel R (2010) Graph theory, 4th edn. Springer, HeidelbergCrossRefGoogle Scholar
- Freeman LC (1978/1979) Centrality in social networks: conceptual clarification. Soc Netw 1:215–239CrossRefGoogle Scholar
- Sabidussi G (1966) The centrality index of a graph. Psychometrika 31:581–603PubMedCrossRefGoogle Scholar
Copyright information
© Springer Science+Business Media, LLC 2013