A distance-regular graph with bipartite geodetically closed subgraphs.

DOI10.1016/S0195-6698(03)00014-3zbMath1037.05050MaRDI QIDQ1873771

Akira Hiraki

Publication date: 27 May 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

hypercubedistance-regular graphKneser graphodd graphgeodetically closed subgraphprojective incidence graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (1)

Strongly closed subgraphs in a distance-regular graph with \(c_{2} > 1\)

Cites Work

• On subgraphs in distance-regular graphs
• Characterization of H(n,q) by the parameters
• On the existence of certain distance-regular graphs
• The dual of Pasch's axiom
• A new condition for distance-regular graphs
• Characterization of projective incidence structures
• Classification of a class of distance-regular graphs via completely regular codes
• The distance-regular graphs of valency four
• On uniformly geodetic graphs
• Distance-regular graphs and (s,c,a,k)-graphs
• A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs
• On strongly closed subgraphs of highly regular graphs
• Cubic Distance-Regular Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: A distance-regular graph with bipartite geodetically closed subgraphs.