Graphs with given diameter maximizing the algebraic connectivity

DOI10.1016/j.laa.2010.06.051zbMath1205.05078MaRDI QIDQ603120

Robert E. Kooij, Hui-Juan Wang, 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

zbMATH Keywords

diameter; graphs; algebraic connectivity; maximize

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C12: Distance in graphs

Related Items

Effective graph resistance, Ordering trees and graphs with few cycles by algebraic connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• \(\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