Graphs with given diameter maximizing the algebraic connectivity
From MaRDI portal
Publication:603120
DOI10.1016/j.laa.2010.06.051zbMath1205.05078OpenAlexW2124303753MaRDI QIDQ603120
Hui-Juan Wang, Robert E. Kooij, Piet Van Mieghem
Publication date: 5 November 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.06.051
Related Items (8)
A new method optimizing the subgraph centrality of large networks ⋮ Nordhaus-Gaddum type inequalities for the \(k\)th largest Laplacian eigenvalues ⋮ Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ Maximizing algebraic connectivity for certain families of graphs ⋮ Effective graph resistance ⋮ Extremal bipartite graphs and unicyclic graphs with respect to the eccentric resistance-distance sum ⋮ Nordhaus-Gaddum type inequalities for the two largest Laplacian eigenvalues
Cites Work
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Old and new results on algebraic connectivity of graphs
- A lower bound for the Laplacian eigenvalues of a graph-proof of a conjecture by Guo
- Graphs with given diameter maximizing the spectral radius
- Laplacian matrices of graphs: A survey
- The Laplacian Spectrum of a Graph II
- An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
- On Spectral Integral Variations of Graphs
- Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that
- Performance Analysis of Communications Networks and Systems
- Synchronization in scale-free dynamical networks: robustness and fragility
- Unnamed Item
- Unnamed Item
This page was built for publication: Graphs with given diameter maximizing the algebraic connectivity
