The connectivity of strongly regular graphs
From MaRDI portal
Publication:1085180
DOI10.1016/S0195-6698(85)80030-5zbMath0607.05045OpenAlexW2050273816MaRDI QIDQ1085180
Andries E. Brouwer, Dale M. Mesner
Publication date: 1985
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(85)80030-5
Related Items
Lower bounds on the vertex-connectivity of digraphs and graphs, Disconnecting strongly regular graphs, Interlacing eigenvalues and graphs, Sufficient conditions for equality of connectivity and minimum degree of a graph, The symmetric (2k, k)-graphs, Minimum cuts of distance-regular digraphs, The spectrum and toughness of regular graphs, The extendability of matchings in strongly regular graphs, On the connectivity of graphs in association schemes, EXISTENCE OF LATIN SQUARE DESIGNS ARISING FROM CLASSICAL GRAPH PARAMETERS B. CHALUVARAJU AND SHAIKH AMEER BASHA, On the vertex connectivity of Deza graphs, Maximally edge-connected and vertex-connected graphs and digraphs: A survey, Unnamed Item, The cyclic edge-connectivity of strongly regular graphs, Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph, Eigenvalues and perfect matchings, The vertex-connectivity of a distance-regular graph, The edge-connectivity of strongly 3-walk-regular graphs, On connectivity in graphs with given clique number, The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs, On vertex connectivity of Deza graphs with parameters of the complements to Seidel graphs, On strictly Deza graphs with parameters \((n, k, k - 1, a)\), On a conjecture of Brouwer involving the connectivity of strongly regular graphs, Degree of indecomposability of certain highly regular zero-one matrices, On distance-regular graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph, On graphs in which the neighborhood of each vertex is isomorphic to the Gewirtz graph, The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs
Cites Work
