Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph

DOI10.1016/j.jcta.2020.105325zbMath1448.05061arXiv1912.06245OpenAlexW3082179577MaRDI QIDQ2005196

Paul M. Terwilliger, Sebastian M. Cioabă, Jack H. Koolen

Publication date: 7 October 2020

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.06245

zbMATH Keywords

eigenvaluedistance-regular graphassociation schemestrongly regular graphdiameterconnectivity\(Q\)-polynomialprimitive idempotentsubconstituentbalanced set condition

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-regular graphs
• On the connectedness of the complement of a ball in distance-regular graphs
• Max-cut and extendability of matchings in distance-regular graphs
• Spectra of graphs
• Shilla distance-regular graphs
• On a conjecture of Brouwer involving the connectivity of strongly regular graphs
• The vertex-connectivity of a distance-regular graph
• The connectivity of strongly regular graphs
• A characterization of \(P\)- and \(Q\)-polynomial association schemes
• Strongly regular graphs having strongly regular subconstituents
• Equiarboreal graphs
• Second neighbourhoods of strongly regular graphs
• A new inequality for distance-regular graphs
• Homotopy in \(Q\)-polynomial distance-regular graphs
• On the connectivity of graphs in association schemes
• Disconnecting strongly regular graphs

This page was built for publication: Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph