Centrality measure in graphs
From MaRDI portal
Publication:977050
DOI10.1007/s10910-009-9635-0zbMath1408.05051OpenAlexW2057962782MaRDI QIDQ977050
Publication date: 16 June 2010
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-009-9635-0
betweennesscentralitygraph metricsneighborliness centralityresistance-distance centralityshortest-path centrality
Related Items
Proximity, remoteness and distance eigenvalues of a graph, Measuring centrality by a generalization of degree, The walk distances in graphs, Two-point resistances in the generalized phenylenes, Proximity, remoteness and girth in graphs, Nordhaus-Gaddum-type results for resistance distance-based graph invariants, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distances and volumina for graphs
- Forest matrices around the Laplacian matrix
- The centrality index of a graph
- A new status index derived from sociometric analysis
- A faster algorithm for betweenness centrality*
- Authoritative sources in a hyperlinked environment
- Functional centrality in graphs
- Centers in Connected Undirected Graphs: An Axiomatic Approach
- An Electrical Lemma
- Community structure in social and biological networks
- SOME CENTRALITY RESULTS NEW AND OLD
- Fast Approximation of Centrality
- BETWEENNESS CENTRALIZATION FOR BIPARTITE GRAPHS
- Some New Results on the Eigenvector Centrality
- Approximating Betweenness Centrality
- Optimum Locations of Centers in Networks
- STACS 2005
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph