A distance-regular graph with strongly closed subgraphs

DOI10.1023/A:1011933828085zbMath1003.05110MaRDI QIDQ1610682

Akira Hiraki

Publication date: 20 August 2002

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

zbMATH Keywords

distance-regular graph; strongly closed subgraph

Mathematics Subject Classification ID

05E30: Association schemes, strongly regular graphs

Related Items

On strongly closed subgraphs with diameter two and the \(Q\)-polynomial property, A characterization of the Hamming graph by strongly closed 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}\), A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph, A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs, A characterization of the Hamming graphs and the dual polar graphs by completely regular subgraphs, Improving diameter bounds for distance-regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Distance-regular subgraphs in a distance-regular graph. V
• Distance-regular subgraphs in a distance-regular graph. VI
• An improvement of the Ivanov bound
• An improvement of the Boshier-Nomura bound
• An improvement of the Godsil bound
• 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
• Distance-regular subgraphs in a distance-regular graph. I
• Strongly closed subgraphs in a regular thick near polygon
• ON THE NON-EXISTENCE OF CERTAIN DISTANCE-REULAR GRAPHS