Distance-Regular Graphs withbt=1 and Ant
β
Makoto Araya; Akira Hiraki; Aleksandar JuriΕ‘iΔ
π
Article
π
1996
π
Elsevier Science
π
English
β 239 KB
Let 1 be a distance-regular graph of diameter d and valency k>2. If b t =1 and 2t d, then 1 is an antipodal double-cover. Consequently, if f >2 is the multiplicity of an eigenvalue of the adjacency matrix of 1 and if 1 is not an antipodal doublecover then d 2f&3. This result is an improvement of God