The vertex-connectivity of a distance-regular graph
From MaRDI portal
Publication:1011508
DOI10.1016/j.ejc.2008.07.006zbMath1175.05072OpenAlexW2023888889MaRDI QIDQ1011508
Jack H. Koolen, Andries E. Brouwer
Publication date: 8 April 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/the-vertexconnectivity-of-a-distanceregular-graph(a288cd40-a4c7-476c-805a-3aa39e0b1e1e).html
Related Items
Disconnecting strongly regular graphs, Minimum cuts of distance-regular digraphs, A Cheeger inequality of a distance regular graph using Green's function, Classifying the globally rigid edge‐transitive graphs and distance‐regular graphs in the plane, The extendability of matchings in strongly regular graphs, Uniformly connected graphs, On the connectivity of graphs in association schemes, On the order of antipodal covers, On the spectra and spectral radii of token graphs, A note on distance-regular graphs with a small number of vertices compared to the valency, On the vertex connectivity of Deza graphs, Graphs associated with matrices over finite fields and their endomorphisms, Distance-regular graphs with or at least half the valency, Max-cut and extendability of matchings in distance-regular graphs, The cyclic edge-connectivity of strongly regular graphs, On orienting graphs for connectivity: Projective planes and Halin graphs, Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph, On the spectral gap and the automorphism group of distance-regular graphs, 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 a conjecture of Brouwer involving the connectivity of strongly regular graphs, Eigenvalues and edge-connectivity of regular graphs, The average search probabilities of discrete-time quantum walks, The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs
Cites Work
