Geodetically closed subgraphs in a distance-regular graph

DOI10.2206/KYUSHUJM.54.155MaRDI QIDQ2769879zbMATH OpenOpenAlexFDO

Authors Akira Hiraki

Publication date 3 June 2002

Published in Kyushu Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2206/kyushujm.54.155

zbMATH Keywords

distance-regular graphgeodetically closed subgraph

Mathematics Subject Classification ID

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

Review text

Let \(\Gamma\) be a distance-regular graph with \((c_1,b_1)=\cdots =(c_r,b_r)\neq (c_{r+1},b_{r+1})\), where \(r\geq 2\) and \(c_{r+1}>1\). Hiraki (1999) proved that either \(r=2\) or \((a_1,a_{r+1},c_{r+1}) =(0,0,2)\). The last case is consider in this paper. Theorem 1. Let \(\Gamma\) be a distance-regular graph of valency \(k\), \((c_1,b_1)=\cdots =(c_r,b_r)=(1,k-1)\) and \((c_{r+1},b_{r+1})=\cdots =(c_{2r},b_{2r}) =(2,k-2)\). Then \(r\leq 2\).

Recommendations

• Weak-geodetically closed subgraphs in distance-regular graphs
• A distance-regular graph with bipartite geodetically closed subgraphs.
• A distance-regular graph with strongly closed subgraphs
• The closed geodetic numbers of graphs
• On subgraphs in distance-regular graphs
• STRONGLY CLOSED SUBGRAPHS OF A DISTANCE-REGULAR GRAPH WITH GEOMETRIC GIRTH FIVE
• Strongly closed geodetic numbers of graphs
• Tight distance-regular graphs with respect to subsets
• A characterization of some distance-regular graphs by strongly closed subgraphs
• The minimal closed geodetic numbers of graphs

Cited in

(2)

• A distance-regular graph with bipartite geodetically closed subgraphs.
• There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency

This page was built for publication: Geodetically closed subgraphs in a distance-regular graph

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