Centrality measure in graphs
From MaRDI portal
Publication:977050
Recommendations
- Centrality measures in networks
- Measuring centrality by a generalization of degree
- CENTRALITY ESTIMATION IN LARGE NETWORKS
- Functional centrality in graphs
- Relative edge betweenness centrality
- Measuring vertex centrality using the Holevo quantity
- Betweenness centrality in some classes of graphs
- Approximating Betweenness Centrality
Cites work
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- scientific article; zbMATH DE number 3735873 (Why is no real title available?)
- scientific article; zbMATH DE number 3737732 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 1890092 (Why is no real title available?)
- scientific article; zbMATH DE number 2230269 (Why is no real title available?)
- A faster algorithm for betweenness centrality*
- A new status index derived from sociometric analysis
- An Electrical Lemma
- Approximating Betweenness Centrality
- Authoritative sources in a hyperlinked environment
- BETWEENNESS CENTRALIZATION FOR BIPARTITE GRAPHS
- Centers in Connected Undirected Graphs: An Axiomatic Approach
- Community structure in social and biological networks
- Distances and volumina for graphs
- Fast Approximation of Centrality
- Forest matrices around the Laplacian matrix
- Functional centrality in graphs
- Optimum Locations of Centers in Networks
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- SOME CENTRALITY RESULTS NEW AND OLD
- STACS 2005
- Some New Results on the Eigenvector Centrality
- The centrality index of a graph
Cited in
(46)- Further results on betweenness centrality of graphs
- SOME CENTRALITY RESULTS NEW AND OLD
- Kirchhoff index as a measure of edge centrality in weighted networks: nearly linear time algorithms
- Spectral bounds for the degree of betweenness of a graph
- An Edge Centrality Measure Based on the Kemeny Constant
- \(p\)-means centrality
- Analytical relationships between metric and centrality measures of a network and its dual
- scientific article; zbMATH DE number 7306903 (Why is no real title available?)
- Axioms for Centrality
- Geometry of complex networks and topological centrality
- A note on the interpretation of the efficiency centrality
- Algebraic distance on graphs
- Centrality
- Relative edge betweenness centrality
- Proximity and remoteness in graphs: a survey
- Variance and covariance of distributions on graphs
- A Shapley distance in graphs
- Betweenness centrality in convex amalgamation of graphs
- Relating centralities in graphs and the principal eigenvector of its distance matrix
- Two-point resistances in the generalized phenylenes
- A centrality notion for graphs based on Tukey depth
- Generalization of effective conductance centrality for egonetworks
- Proximity, remoteness and girth in graphs
- A novel measure of edge and vertex centrality for assessing robustness in complex networks
- Network Analysis
- Classroom note: an application of edge clustering centrality to brain connectivity
- Measuring centrality by a generalization of degree
- Convex combinations of centrality measures
- Laplacian centrality: A new centrality measure for weighted networks
- Centrality measures in networks
- Nordhaus-Gaddum-type results for resistance distance-based graph invariants
- Applications of graph theory in studying protein structure, dynamics, and interactions
- Ordering graphs in a normalized singular value measure
- Proximity, remoteness and distance eigenvalues of a graph
- On the evaluation of graph centrality for shape matching
- On decay centrality in graphs
- Graphs with absorption: numerical methods for the absorption inverse and the computation of centrality measures
- On decay centrality
- On proximity measures for graph vertices
- A maple package for integro-differential operators and boundary problems
- Vector centrality in hypergraphs
- Measuring vertex centrality using the Holevo quantity
- Game of thieves and WERW-Kpath: two novel measures of node and edge centrality for mafia networks
- The walk distances in graphs
- Functional centrality in graphs
- Communicability cosine distance: similarity and symmetry in graphs/networks
This page was built for publication: Centrality measure in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q977050)
