Premium
Antipodal distance‐regular graphs of diameter four and five
Author(s) -
Schade Tilla
Publication year - 1999
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/(sici)1520-6610(1999)7:1<69::aid-jcd8>3.0.co;2-v
Subject(s) - antipodal point , combinatorics , mathematics , graph , strongly regular graph , discrete mathematics , line graph , pathwidth , geometry
An antipodal distance‐regular graph of diameter four or five is a covering graph of a connected strongly regular graph. We give existence conditions for these graphs and show for some types of strongly regular graphs that no nontrivial covers exist. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 69–77, 1999