The centrality of a graph.

By G. Sabidussi. 1966

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Continual Learning on Noisy Data Streams via Self-Purified Replay (2021, background): “At the core of the Self-Centered filter lies centrality [59], which is rooted in graph theory to identify the most influential vertices within a graph.”
A Critical Review of Centrality Measures in Social Networks (2010, methodology): “…a reflective use of CM. Based on the findings of the SNA literature, in the following section we motivate and formulate three simple general, quantitative , and thus intersubjectively verifiable properties of CM in social networks, partly drawing on the work of Nieminen (1974) and Sabidussi (1966).”
Study on centrality measures in social networks: a survey (2018, background): “Shaw (1954) first introduced degree centrality as an index of important vertex and hence defined by Nieminen (1974).”
Entrepreneurs’ networks and the success of start-ups (2004, background): “The description of actors in networks has traditionally been dominated by the concept of centrality (Bavelas 1948, Nieminen 1974, Freeman 1978/79).”
Mining email social networks (2006, background): “Out-degree also shows a scalefree, or power-law distribution, characteristic of small-world social networks [2, 9, 10, 15].”
A New Measure of Centrality for Brain Networks (2010, background): “Such nodes are central in network organization, and are often identified by quantities known as centrality metrics [6,7,8,9,10, 11,12,13,14].”
Network analysis of protein structures identifies functional residues. (2004, background): “63 The formula for closeness centrality calculation 62,63 is shown in equation (1).”
Environmental Context, Managerial Cognition, and Strategic Action: An Integrated View (2008, background): “…centrality is obtained by using the shortest paths from the focal concept to reach all other concepts in the network as follows (Freeman, 1978/1979; Nieminen, 1974): where: CD(Pk) = number of concepts connected to concept k d(pi, pk) = distances: shortest number of paths that concept pi has to go…”