Graphs with given diameter maximizing the algebraic connectivity

DOI10.1016/J.LAA.2010.06.051MaRDI QIDQ603120zbMATH OpenOpenAlexFDO

Authors Huijuan 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

zbMATH Keywords

graphsdiameteralgebraic connectivitymaximize

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Recommendations

• On trees with maximum algebraic connectivity
• Proof of conjectures involving algebraic connectivity of graphs
• Lower bounds of the Laplacian spectrum of graphs based on diameter
• Maximizing the Laplacian spectral radii of graphs with given diameter
• scientific article; zbMATH DE number 4208110

Cites work

• scientific article; zbMATH DE number 867649 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• A lower bound for the Laplacian eigenvalues of a graph-proof of a conjecture by Guo
• An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
• Graphs with given diameter maximizing the spectral radius
• Laplacian matrices of graphs: A survey
• Old and new results on algebraic connectivity of graphs
• 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
• The Laplacian Spectrum of a Graph II
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators

Cited in

(14)

• Algorithms for finding diameter-constrained graphs with maximum algebraic connectivity
• Nordhaus-Gaddum type inequalities for the two largest Laplacian eigenvalues
• Effective graph resistance
• A new method optimizing the subgraph centrality of large networks
• Maximizing Algebraic Connectivity Over Unicyclic Graphs
• Maximizing algebraic connectivity for certain families of graphs
• On trees with maximum algebraic connectivity
• Extremal bipartite graphs and unicyclic graphs with respect to the eccentric resistance-distance sum
• Nordhaus-Gaddum type inequalities for the \(k\)th largest Laplacian eigenvalues
• Effects on the algebraic connectivity of weighted graphs under edge rotations
• Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra
• Attainable bounds for algebraic connectivity and maximally connected regular graphs
• Ordering trees and graphs with few cycles by algebraic connectivity
• The algebraic connectivity of barbell graphs

This page was built for publication: Graphs with given diameter maximizing the algebraic connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q603120)