Edge-connectivity in regular multigraphs from eigenvalues

DOI10.1016/j.laa.2014.09.015zbMath1330.05106arXiv1409.6065OpenAlexW1969496240MaRDI QIDQ5962474

Suil O

Publication date: 12 February 2016

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

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

zbMATH Keywords

edge-connectivityregular multigraphssecond largest eigenvalue

Mathematics Subject Classification ID

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

Related Items (9)

Spectral Bounds for the Connectivity of Regular Graphs with Given Order ⋮ The second largest eigenvalue and vertex-connectivity of regular multigraphs ⋮ Sharp spectral bounds for the vertex-connectivity of regular graphs ⋮ Spectral conditions for edge connectivity and packing spanning trees in multigraphs ⋮ Sharp spectral bounds for the edge-connectivity of regular graphs ⋮ Connectivity and eigenvalues of graphs with given girth or clique number ⋮ Extremal problems on saturation for the family of $k$-edge-connected graphs ⋮ Vertex-connectivity and eigenvalues of graphs with fixed girth ⋮ Vertex-connectivity and eigenvalues of graphs

Cites Work

• Minimum cuts, girth and a spectral threshold
• Eigenvalues and edge-connectivity of regular graphs
• On graphs with equal algebraic and vertex connectivity
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge-connectivity in regular multigraphs from eigenvalues