Retracing argument for distance-regular graphs

DOI10.1006/JCTB.2000.1961MaRDI QIDQ1850478zbMATH OpenOpenAlexFDO

Authors Akira Hiraki

Publication date 10 December 2002

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jctb.2000.1961

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Recommendations

• Applications of the retracing method for distance-regular graphs
• scientific article; zbMATH DE number 4106886
• On constructing regular distance-preserving graphs
• scientific article; zbMATH DE number 43547
• Distance-regular graphs
• On almost distance-regular graphs
• scientific article; zbMATH DE number 47845
• scientific article; zbMATH DE number 1303108
• A new condition for distance-regular graphs
• Characerization of a class of distance regular graphs.

Cites work

• A circuit chasing technique in a distance-regular graph with triangles
• A remark on the intersection arrays of distance-regular graphs
• An improvement of the Boshier-Nomura bound
• Applications of the retracing method for distance-regular graphs
• Cubic Distance-Regular Graphs
• Distance-regular subgraphs in a distance-regular graph. I
• Distance-regular subgraphs in a distance-regular graph. II
• Distance-regular subgraphs in a distance-regular graph. III
• scientific article; zbMATH DE number 43547 (Why is no real title available?)

Cited in

(2)

• Distance-regular graph with \(c_{2} > 1\) and \(a_{1} = 0 < a_{2}\)
• Applications of the retracing method for distance-regular graphs

This page was built for publication: Retracing argument for distance-regular graphs

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