Distance-regular graphs with \(c_i=b_{d-i}\) and antipodal double covers

DOI10.1023/A:1008681526048zbMath0932.05095MaRDI QIDQ1272893

Akira Hiraki, Makoto Araya

Publication date: 13 March 2000

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

zbMATH Keywords

distance-regular graphantipodal double cover

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Distance-regular graphs with \(b_ 2=1\) and antipodal covers
• Distance-regular graphs with \(b_ t=1\) and antipodal double-covers
• Antipodal covering graphs

This page was built for publication: Distance-regular graphs with \(c_i=b_{d-i}\) and antipodal double covers