The connectivity of strongly regular graphs

DOI10.1016/S0195-6698(85)80030-5MaRDI QIDQ1085180zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

connectivityneighbourhood of a vertexsmallest cutsetstrongly regular graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)

Review text

Es wird bewiesen, daß in einem streng regulären Graphen jede kleinste trennende Eckenmenge aus den Nachbarn einer Ecke bestehen muß.

Cites work

• scientific article; zbMATH DE number 3670480 (Why is no real title available?)
• scientific article; zbMATH DE number 3733985 (Why is no real title available?)
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3

Cited in

(34)

• The vertex-connectivity of a distance-regular graph
• 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
• Long path connectivity of regular graphs
• Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks
• On the connectivity of graphs in association schemes
• Eigenvalues and perfect matchings
• Interlacing eigenvalues and graphs
• The cyclic edge-connectivity of strongly regular graphs
• Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph
• The edge-connectivity of strongly 3-walk-regular 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)\)
• Minimum cuts of distance-regular digraphs
• Degree of indecomposability of certain highly regular zero-one matrices
• Disconnecting strongly regular graphs
• The symmetric (2k, k)-graphs
• On the first-order complexity of induced subgraph isomorphism
• The spectrum and toughness of regular graphs
• The extendability of matchings in strongly regular graphs
• Sufficient conditions for equality of connectivity and minimum degree of a graph
• On the vertex connectivity of Deza graphs
• scientific article; zbMATH DE number 4119945 (Why is no real title available?)
• The power of the Weisfeiler-Leman algorithm to decompose graphs
• The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs
• Strong subgraph k‐connectivity
• On connectivity in graphs with given clique number
• EXISTENCE OF LATIN SQUARE DESIGNS ARISING FROM CLASSICAL GRAPH PARAMETERS B. CHALUVARAJU AND SHAIKH AMEER BASHA
• The Gallai and anti-Gallai graphs of strongly regular graphs
• Connectivity versus Lin-Lu-Yau curvature
• Spectral properties of generalized Paley graphs of (q^+1)th powers and applications
• On a conjecture of Brouwer involving the connectivity of strongly regular graphs
• Lower bounds on the vertex-connectivity of digraphs and graphs
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey

This page was built for publication: The connectivity of strongly regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1085180)