On a conjecture of Brouwer involving the connectivity of strongly regular graphs

DOI10.1016/j.jcta.2012.01.001zbMath1241.05149arXiv1105.0796OpenAlexW1881326960WikidataQ123265839 ScholiaQ123265839MaRDI QIDQ765871

Sebastian M. Cioabă, Kijung Kim, Jack H. Koolen

Publication date: 22 March 2012

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

strongly regular graphseigenvaluesconnectivitydistance regular graphscopolar spacesdelta spaces

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Related Items (9)

A problem of Shapozenko on Johnson graphs ⋮ Disconnecting strongly regular graphs ⋮ The extendability of matchings in strongly regular graphs ⋮ On the connectivity of graphs in association schemes ⋮ Max-cut and extendability of matchings in distance-regular graphs ⋮ The cyclic edge-connectivity of strongly regular graphs ⋮ Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph ⋮ Spectral threshold for extremal cyclic edge-connectivity ⋮ The edge-connectivity of strongly 3-walk-regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance regular graphs of diameter 3 and strongly regular graphs
• The vertex-connectivity of a distance-regular graph
• The connectivity of strongly regular graphs
• Eigenvalues and expanders
• The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
• Strongly regular graphs with smallest eigenvalue -m
• The Gewirtz graph: An exercise in the theory of graph spectra
• Simple Lie algebras and graphs
• Problems in algebraic combinatorics
• An isoperimetric problem in Cayley graphs
• Chromatic number and the 2-rank of a graph
• Interlacing eigenvalues and graphs
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Symplectic graphs and their automorphisms
• Strongly regular graphs, partial geometries and partially balanced designs
• Finite nets. II: Uniqueness and imbedding
• Explicit Concentrators from Generalized N-Gons
• CLASSIFYING COPOLAR SPACES AND GRAPHS
• A spectral approach to bandwidth and separator problems in graphs
• Random strongly regular graphs?

This page was built for publication: On a conjecture of Brouwer involving the connectivity of strongly regular graphs