A characterization of the Hamming graphs and the dual polar graphs by completely regular subgraphs

DOI10.1007/s00373-011-1064-8zbMath1256.05258OpenAlexW2079020521MaRDI QIDQ1926034

Akira Hiraki

Publication date: 27 December 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1064-8

zbMATH Keywords

distance-regular graphHamming graphdual polar graphcompletely regular

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of the Hamming graph by strongly closed subgraphs
• A characterization of some distance-regular graphs by strongly closed subgraphs
• Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs
• The structure of near polygons with quads
• Distance-regular subgraphs in a distance-regular graph. IV
• A distance-regular graph with strongly closed subgraphs
• 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

This page was built for publication: A characterization of the Hamming graphs and the dual polar graphs by completely regular subgraphs