On the connectedness of the complement of a ball in distance-regular graphs
From MaRDI portal
Publication:356734
DOI10.1007/S10801-012-0398-5zbMATH Open1269.05118OpenAlexW2164339291MaRDI QIDQ356734FDOQ356734
Authors: Sebastian Cioaba, Jack H. Koolen 
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
Recommendations
- Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph
- Complements of distance-regular graphs
- Distance-regular subgraphs in a distance-regular graph. V
- A distance-regular graph with strongly closed subgraphs
- Distance regular graphs in which local subgraphs are strongly regular graphs with the second eigenvalue at most 3
Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Connectivity (05C40)
Cites Work
Cited In (11)
- The extendability of matchings in strongly regular graphs
- Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph
- Twice \(Q\)-polynomial distance-regular graphs of diameter 4
- On a conjecture of Brouwer involving the connectivity of strongly regular graphs
- On the second neighbourhoods of quasi-strongly regular graphs
- On outindependent subgraphs of strongly regular graphs
- On symmetric and Hermitian rank distance codes
- On the connectivity of graphs in association schemes
- Complements of distance-regular graphs
- On Deza graphs with disconnected second neighborhood of a vertex
- Max-cut and extendability of matchings in distance-regular graphs
This page was built for publication: On the connectedness of the complement of a ball in distance-regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q356734)
