A characterization of the Hamming graph by strongly closed subgraphs

DOI10.1016/j.ejc.2007.11.001zbMath1152.05061OpenAlexW1992283176MaRDI QIDQ942131

Akira Hiraki

Publication date: 4 September 2008

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

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

Mathematics Subject Classification ID

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

Related Items (4)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(D\)-bounded distance-regular graphs
• Distance-regular graphs with girth 3 or 4: I
• Characterization of H(n,q) by the parameters
• Weak-geodetically closed subgraphs in distance-regular graphs
• Distance-regular subgraphs in a distance-regular graph. VI
• The distance-regular graphs of valency four
• A distance-regular graph with strongly closed subgraphs
• The regular near polygons of order \((s,2)\)
• 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

This page was built for publication: A characterization of the Hamming graph by strongly closed subgraphs