A lower bound for algebraic connectivity based on the connection-graph-stability method

DOI10.1016/j.laa.2010.12.019zbMath1226.05146arXiv0909.2782OpenAlexW2064571435WikidataQ107438156 ScholiaQ107438156MaRDI QIDQ2431183

Ali Ajdari Rad, Mahdi Jalili, Martin Hasler

Publication date: 11 April 2011

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0909.2782

zbMATH Keywords

algebraic connectivitygraph Laplacianconnection-graph-stability score

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)

Related Items (5)

Spectral Bounds for the Connectivity of Regular Graphs with Given Order ⋮ Lower bounds for the algebraic connectivity of graphs with specified subgraphs ⋮ Optimization of synchronizability in complex spatial networks ⋮ Sharp spectral bounds for the edge-connectivity of regular graphs ⋮ Efficient rewirings for enhancing synchronizability of dynamical networks

Cites Work

• Unnamed Item
• Lower bounds of the Laplacian spectrum of graphs based on diameter
• Old and new results on algebraic connectivity of graphs
• Eigenvalues, diameter, and mean distance in graphs
• Connection graph stability method for synchronized coupled chaotic systems
• A faster algorithm for betweenness centrality*

This page was built for publication: A lower bound for algebraic connectivity based on the connection-graph-stability method