Spectral bounds for the betweenness of a graph

DOI10.1016/j.laa.2006.08.027zbMath1114.05058OpenAlexW2049483270WikidataQ112882151 ScholiaQ112882151MaRDI QIDQ876305

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

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

Related Items (10)

On the connectivity and the diameter of betweenness-uniform graphs ⋮ Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them ⋮ More on betweenness-uniform graphs ⋮ Bounds and relations involving adjusted centrality of the vertices of a tree ⋮ Non-representative sampled networks: estimation of network structural properties by weighting ⋮ Graph clustering ⋮ On the connectivity and the diameter of betweenness-uniform graphs ⋮ On betweenness-uniform graphs ⋮ Uniform edge betweenness centrality ⋮ Network synchronizability analysis: A graph-theoretic approach

Cites Work

• Unnamed Item
• Expanding and forwarding
• On forwarding indices of networks
• Isoperimetric numbers of graphs
• The forwarding index of communication networks
• The Structure and Function of Complex Networks
• Community structure in social and biological networks
• Classification of scale-free networks

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