Graphs with given diameter maximizing the algebraic connectivity
- 30 August 2010
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 433 (11-12) , 1889-1908
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A lower bound for the Laplacian eigenvalues of a graph—Proof of a conjecture by GuoLinear Algebra and its Applications, 2008
- Graphs with given diameter maximizing the spectral radiusLinear Algebra and its Applications, 2007
- Old and new results on algebraic connectivity of graphsLinear Algebra and its Applications, 2007
- Synchronization in scale-free dynamical networks: robustness and fragilityIEEE Transactions on Circuits and Systems I: Regular Papers, 2002
- SYNCHRONIZATION IN SMALL-WORLD DYNAMICAL NETWORKSInternational Journal of Bifurcation and Chaos, 2002
- On Spectral Integral Variations of GraphsLinear and Multilinear Algebra, 2002
- An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its LaplacianSIAM Journal on Discrete Mathematics, 1994
- The Laplacian Spectrum of a Graph IISIAM Journal on Discrete Mathematics, 1994
- Laplacian matrices of graphs: a surveyLinear Algebra and its Applications, 1994
- λ1, Isoperimetric inequalities for graphs, and superconcentratorsJournal of Combinatorial Theory, Series B, 1985