Distance-regular graphs with b_ 2=1 and antipodal covers

DOI10.1006/EUJC.1996.0097MaRDI QIDQ1357653zbMATH OpenOpenAlexFDO

Authors Makoto Araya, Akira Hiraki, Aleksandar Jurišić

Publication date 24 September 1997

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

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

zbMATH Keywords

distance-regular graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Association schemes, strongly regular graphs (05E30)

Recommendations

• scientific article; zbMATH DE number 482045
• Distance-regular graphs with \(b_ t=1\) and antipodal double-covers
• Distance-regular antipodal covering graphs
• Distance-regular graphs with \(c_i=b_{d-i}\) and antipodal double covers

Cited in

(10)

• Distance-regular graphs with \(c_i=b_{d-i}\) and antipodal double covers
• Merging in antipodal distance-regular graphs
• Antipodal covers of strongly regular graphs
• On distance-regular graphs with \(k_ i= k_ j\). II
• Distance-regular graphs with \(b_ t=1\) and antipodal double-covers
• A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices
• scientific article; zbMATH DE number 15084 (Why is no real title available?)
• scientific article; zbMATH DE number 482045 (Why is no real title available?)
• On strongly regular graphs with parameters \((k,0,2)\) and their antipodal double covers
• Distance regular graphs of diameter 3 and strongly regular graphs

This page was built for publication: Distance-regular graphs with \(b_ 2=1\) and antipodal covers

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