On the connectedness of the complement of a ball in distance-regular graphs
From MaRDI portal
Publication:356734
DOI10.1007/s10801-012-0398-5zbMath1269.05118OpenAlexW2164339291MaRDI QIDQ356734
Jack H. Koolen, Sebastian M. Cioabă
Publication date: 26 July 2013
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10801-012-0398-5
Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Connectivity (05C40)
Related Items (8)
Twice \(Q\)-polynomial distance-regular graphs of diameter 4 ⋮ On the second neighbourhoods of quasi-strongly regular graphs ⋮ On Deza graphs with disconnected second neighborhood of a vertex ⋮ 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 ⋮ Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph ⋮ On symmetric and Hermitian rank distance codes
Cites Work
This page was built for publication: On the connectedness of the complement of a ball in distance-regular graphs