Spectral bounds for the betweenness of a graph
DOI10.1016/J.LAA.2006.08.027zbMATH Open1114.05058OpenAlexW2049483270WikidataQ112882151 ScholiaQ112882151MaRDI QIDQ876305FDOQ876305
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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12) Paths and cycles (05C38)
Cites Work
- The Structure and Function of Complex Networks
- Community structure in social and biological networks
- Title not available (Why is that?)
- Isoperimetric numbers of graphs
- On forwarding indices of networks
- Expanding and forwarding
- The forwarding index of communication networks
- Classification of scale-free networks
Cited In (14)
- Uniform edge betweenness centrality
- On the connectivity and the diameter of betweenness-uniform graphs
- Network synchronizability analysis: a graph-theoretic approach
- Bounds and relations involving adjusted centrality of the vertices of a tree
- 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
- Spectral bounds for the degree of betweenness of a graph
- Some bounds for total communicability of graphs
- 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)
