A characterization of some distance-regular graphs by strongly closed subgraphs

DOI10.1016/j.ejc.2008.07.015zbMath1228.05313OpenAlexW2088362290MaRDI QIDQ1024283

Akira Hiraki

Publication date: 17 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2008.07.015

Mathematics Subject Classification ID

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

Related Items (5)

Light tails and the Hermitian dual polar graphs ⋮ A characterization of the Hamming graphs and the dual polar graphs by completely regular subgraphs ⋮ A new characterization of the dual polar graphs ⋮ Strongly closed subgraphs in a distance-regular graph with \(c_{2} > 1\) ⋮ Distance-regular graph with \(c_{2} > 1\) and \(a_{1} = 0 < a_{2}\)

Cites Work

• Unnamed Item
• Unnamed Item
• \(D\)-bounded distance-regular graphs
• A characterization of the Hamming graph by strongly closed subgraphs
• Weak-geodetically closed subgraphs in distance-regular graphs
• Classical distance-regular graphs of negative type
• A distance-regular graph with strongly closed subgraphs
• Applications of the retracing method for distance-regular 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
• Strongly closed subgraphs in a regular thick near polygon
• Triangle-free distance-regular graphs

This page was built for publication: A characterization of some distance-regular graphs by strongly closed subgraphs