An application of a construction theory of strongly closed subgraphs in a distance-regular graph

DOI10.1006/EUJC.1998.0262zbMATH Open0924.05070OpenAlexW2084998626MaRDI QIDQ1294060FDOQ1294060

Akira Hiraki

Publication date: 29 June 1999

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

Full work available at URL: https://doi.org/10.1006/eujc.1998.0262

Recommendations

• A characterization of some distance-regular graphs by strongly closed subgraphs
• Strongly closed subgraphs in a distance-regular graph with \(c_{2} > 1\)
• A distance-regular graph with strongly closed subgraphs
• Distance-regular graphs with strongly regular subconstituents
• On strongly closed subgraphs of highly regular graphs
• The existence of strongly closed subgraphs in highly regular graphs
• A construction of distance-regular graphs from subspaces in \(d\)-bounded distance-regular graphs.
• Lattices generated by strongly closed subgraphs in \(d\)-bounded distance-regular graphs
• On subgraphs in distance-regular graphs
• Strongly closed subgraphs in a regular thick near polygon

zbMATH Keywords

distance-regular graphstrongly closed subgraphs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Cited In (3)

• Strongly closed subgraphs in a distance-regular graph with \(c_{2} > 1\)
• On strongly closed subgraphs of highly regular graphs
• Distance-regular graph with \(c_{2} > 1\) and \(a_{1} = 0 < a_{2}\)

This page was built for publication: An application of a construction theory of strongly closed subgraphs in a distance-regular graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294060)