Antipodal graphs of diameter three

DOI10.1016/0024-3795(82)90036-2zbMath0497.05053OpenAlexW2045457737WikidataQ126816939 ScholiaQ126816939MaRDI QIDQ1170206

S. Singh

Publication date: 1982

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(82)90036-2

zbMATH Keywords

distance-regular graphspectrumintersection arrayantipodal graphr-fold covering of a complete graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items (4)

A family of antipodal distance-regular graphs related to the classical Preparata codes ⋮ Almost rank three graphs ⋮ On a class of vertex-transitive distance-regular covers of complete graphs ⋮ On the weak-noise limit of Fokker-Planck models

Cites Work

• Unnamed Item
• Antipodal covering graphs
• On Trivalent Graphs

This page was built for publication: Antipodal graphs of diameter three