Spectral bounds for the betweenness of a graph

DOI10.1016/J.LAA.2006.08.027MaRDI QIDQ876305zbMATH OpenOpenAlexWikidataFDO

Authors Francesc Comellas, Silvia Gago

Publication date 18 April 2007

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2006.08.027

zbMATH Keywords

eigenvaluesLaplacian matrixspectraisoperimetric numberedge betweenness

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12) Paths and cycles (05C38)

Recommendations

• Spectral bounds for the degree of betweenness of a graph
• Notes on the betweenness centrality of a graph
• Laplacian spectra and invariants of graphs
• Weighted betweenness and algebraic connectivity
• scientific article; zbMATH DE number 2192118

Cites work

• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Classification of scale-free networks
• Community structure in social and biological networks
• Expanding and forwarding
• Isoperimetric numbers of graphs
• On forwarding indices of networks
• The Structure and Function of Complex Networks
• The forwarding index of communication networks

Cited in

(14)

• On the connectivity and the diameter of betweenness-uniform graphs
• Uniform edge betweenness centrality
• Bounds and relations involving adjusted centrality of the vertices of a tree
• Network synchronizability analysis: a graph-theoretic approach
• On betweenness-uniform graphs.
• More on betweenness-uniform graphs.
• Lower and upper bounds on graph communicabilities
• On the connectivity and the diameter of betweenness-uniform graphs
• Non-representative sampled networks: estimation of network structural properties by weighting
• Weighted betweenness and algebraic connectivity
• Some bounds for total communicability of graphs
• Spectral bounds for the degree of betweenness of a graph
• Graph clustering
• Structural vulnerability and robustness in complex networks: different approaches and relationships between them

This page was built for publication: Spectral bounds for the betweenness of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876305)