Spectral Bounds for the Connectivity of Regular Graphs with Given Order

zbMath1396.05063arXiv1703.02748MaRDI QIDQ4685895

Boris Brimkov, Jingmei Zhang, Aida Abiad, Xavier Martinez-Rivera, Suil O

Publication date: 9 October 2018

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

zbMATH Keywords

edge-connectivityregular multigraphalgebraic connectivityvertex-connectivitysecond-largest eigenvalue

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Connectivity (05C40)

Related Items (10)

The second largest eigenvalue and vertex-connectivity of regular multigraphs ⋮ Sharp spectral bounds for the vertex-connectivity of regular graphs ⋮ Sharp spectral bounds for the edge-connectivity of regular graphs ⋮ Toughness in pseudo-random graphs ⋮ Connectivity and eigenvalues of graphs with given girth or clique number ⋮ Vertex-connectivity and eigenvalues of graphs with fixed girth ⋮ Vertex-connectivity and eigenvalues of graphs ⋮ On algebraic connectivity of directed scale-free networks ⋮ Cospectral pairs of regular graphs with different connectivity ⋮ Spectral threshold for extremal cyclic edge-connectivity

Cites Work

• The smallest values of algebraic connectivity for unicyclic graphs
• Spectra of graphs
• Old and new results on algebraic connectivity of graphs
• Absolute algebraic connectivity of double brooms and trees
• Minimum cuts, girth and a spectral threshold
• Eigenvalues and edge-connectivity of regular graphs
• Regular multigraphs and their application to the Monte Carlo evaluation of moments of non-linear functions of Gaussian random variables
• Resilience and survivability in communication networks: strategies, principles, and survey of disciplines
• A lower bound for algebraic connectivity based on the connection-graph-stability method
• The six classes of trees with the largest algebraic connectivity
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
• Enumeration of graphs by degree sequence
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Data Security Equals Graph Connectivity
• On graphs with equal algebraic and vertex connectivity
• Edge-connectivity in regular multigraphs from eigenvalues
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Spectral Bounds for the Connectivity of Regular Graphs with Given Order