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

DOI10.1016/J.JCTA.2020.105325zbMATH Open1448.05061arXiv1912.06245OpenAlexW3082179577MaRDI QIDQ2005196FDOQ2005196

Authors: Sebastian Cioaba, Jack H. Koolen, Paul Terwilliger 

Publication date: 7 October 2020

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

Abstract: Let $Gamma$ be a $Q$-polynomial distance-regular graph of diameter $dgeq3$. Fix a vertex $gamma$ of $Gamma$ and consider the subgraph induced on the union of the last two subconstituents of $Gamma$ with respect to $gamma$. We prove that this subgraph is connected.

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

Recommendations

• The last subconstituent of a bipartite \(Q\)-polynomial distance-regular graph
• A characterization of \(Q\)-polynomial distance-regular graphs
• Tight distance-regular graphs and the \(Q\)-polynomial property
• \(Q\)-polynomial distance-regular graphs with \(a_1=0\) and \(a_2\neq 0\)
• Connectedness of digraphs from quadratic polynomials
• Almost-bipartite distance-regular graphs with the \(Q\)-polynomial property
• \(Q\)-polynomial distance-regular graphs with \(a_1=0\)
• Distance-regular graphs of type \(E_1\circ E_d\) and the \(Q\)-polynomial property
• A characterization of \(Q\)-polynomial distance-regular graphs using the intersection numbers
• The parameters of bipartite \(Q\)-polynomial distance-regular graphs

zbMATH Keywords

strongly regular graphassociation schemediameterdistance-regular grapheigenvalueconnectivity\(Q\)-polynomialsubconstituentprimitive idempotentbalanced set condition

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Spectra of graphs
• Title not available (Why is that?)
• Disconnecting strongly regular graphs
• Distance-regular graphs
• Title not available (Why is that?)
• On a conjecture of Brouwer involving the connectivity of strongly regular graphs
• Title not available (Why is that?)
• Strongly regular graphs having strongly regular subconstituents
• Second neighbourhoods of strongly regular graphs
• Title not available (Why is that?)
• On the connectedness of the complement of a ball in distance-regular graphs
• Shilla distance-regular graphs
• A new inequality for distance-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
• On the connectivity of graphs in association schemes
• Equiarboreal graphs
• Max-cut and extendability of matchings in distance-regular graphs
• Homotopy in \(Q\)-polynomial distance-regular graphs

Cited In (2)

• Connectedness of digraphs from quadratic polynomials
• On the connectedness of the complement of a ball in distance-regular graphs

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

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