Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs

DOI10.1007/s10801-009-0167-2zbMath1229.05299OpenAlexW2028226601MaRDI QIDQ1043847

Hiroshi Suzuki

Publication date: 9 December 2009

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

Full work available at URL: https://doi.org/10.1007/s10801-009-0167-2

zbMATH Keywords

distance-regular graphassociation schemehomogeneitycompletely regular code

Mathematics Subject Classification ID

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

Related Items (2)

A unified view of inequalities for distance-regular graphs. I ⋮ A characterization of the Hamming graphs and the dual polar graphs by completely regular subgraphs

Cites Work

• Tight distance-regular graphs with respect to subsets
• Completely regular codes
• Weak-geodetically closed subgraphs in distance-regular graphs
• Width and dual width of subsets in polynomial association schemes
• On strongly closed subgraphs of highly regular graphs
• The subconstituent algebra of a strongly regular graph
• Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
• Distance-regular graphs of Hamming type
• STRONGLY CLOSED SUBGRAPHS OF A DISTANCE-REGULAR GRAPH WITH GEOMETRIC GIRTH FIVE
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs