Strongly closed subgraphs in a distance-regular graph with \(c_{2} > 1\)

DOI10.1007/s00373-008-0814-8zbMath1163.05059OpenAlexW2003958989MaRDI QIDQ1015439

Akira Hiraki

Publication date: 8 May 2009

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

Full work available at URL: https://doi.org/10.1007/s00373-008-0814-8

zbMATH Keywords

distance-regular graphstrongly closed subgraph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items

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
• A characterization of some distance-regular graphs by strongly closed subgraphs
• Distance-regular graph with \(c_{2} > 1\) and \(a_{1} = 0 < a_{2}\)
• Dual polar spaces
• Weak-geodetically closed subgraphs in distance-regular graphs
• Distance-regular subgraphs in a distance-regular graph. V
• Distance-regular subgraphs in a distance-regular graph. VI
• An application of a construction theory of strongly closed subgraphs in a distance-regular graph
• 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
• A distance-regular graph with bipartite geodetically closed subgraphs.
• On strongly closed subgraphs of highly regular graphs
• Strongly closed subgraphs in a regular thick near polygon