ELibM Journals • ELibM Home • EMIS Home • EMIS Mirrors

  EMIS Electronic Library of Mathematics (ELibM)
The Open Access Repository of Mathematics
  EMIS ELibM Electronic Journals

JOURNAL OF
ALGEBRAIC
COMBINATORICS
  Editors-in-chief: C. A. Athanasiadis, T. Lam, A. Munemasa, H. Van Maldeghem
ISSN 0925-9899 (print) • ISSN 1572-9192 (electronic)
 

A Distance-Regular Graph with Intersection Array (5, 4, 3, 3; 1, 1, 1, 2) Does Not Exist

D.G. Fon-Der-Flaass

DOI: 10.1023/A:1022476614402

Abstract

We prove that a distance-regular graph with intersection array (5, 4, 3, 3; 1, 1, 1, 2) does not exist. The proof is purely combinatorial and computer-free.

Pages: 49–56

Keywords: distance-regular graph; intersection array

Full Text: PDF

References

1. A.E. Brouwer, A.M. Cohen, and A. Neumaier. Distance-Regular Graphs, Springer-Verlag, Berlin, 1989.
2. D.G. Fon-Der-Flaass. "There exists no distance-regular graph with intersection array (5, 4, 3; 1, 1, 2)." to appear in Europ. J. Combinatorics.



© 1992–2009 Journal of Algebraic Combinatorics
© 2012 FIZ Karlsruhe / Zentralblatt MATH for the EMIS Electronic Edition