A root graph that is locally the line graph of the Petersen graph

Discrete Mathematics

Volumn 264, Issue 1-3, 2003, Pages 13-24

  Brouwer, A E ^a   Koolen, J H ^b   Klin, M H ^c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b BIELEFELD UNIVERSITY   (Germany)

^c BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Distance regular graph; Local characterization; Root graph; Strongly regular graph; Symmetric design

Indexed keywords

EID: 84867976073     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00546-0     Document Type: Conference Paper

References (13)

1. A.E. Brouwer, Distance regular graphs of diameter 3 and strongly regular graphs, Discrete Math. 49 (1984) 101-103.
2. A.E. Brouwer, A.M. Cohen, A. Neumaier, Distance-Regular Graphs, Springer, Heidelberg, 1989.
3. A.E. Brouwer, J.H. van Lint, Strongly regular graphs and partial geometries, in: D.M. Jackson, S.A. Vanstone (Eds.), Enumeration and Design-Proceedings of the Silver Jubilee Conference on Combinatorics, Waterloo, 1982, Academic Press, Toronto, 1984, pp. 85-122.
4. I.A. Faradzev, M. H. Klin, Computer package for computations with coherent con>gurations, Proceedings of the 1991 International Symposium on Symbiosis and Algebra, Computations, ISSAC '91, Bonn, July 15-17, 1991), ACM Press, New York, pp. 219-223.
5. C.D. Godsil, A.D. Hensel, Distance regular covers of the complete graph, J. Combin. Theory Ser. B 56 (1992) 205-238.
6. D. Jungnickel, A. Pott, DiPerence sets: Abelian, in: C.J. Colbourn, J.H. Dinitz (Eds.), The CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton, FL, 1996, pp. 297-307.
7. M.H. Klin, Strongly regular Cayley graphs on 96 vertices, J. Geometry 65 (1999) 15-16.
8. J.H. Koolen, Euclidean representations and substructures of distance-regular graphs, Thesis, Techn. University Eindhoven, 1994.
9. B.D. McKay, Nauty users guide (version 1.5), Technical Report TR-CS-90-02, Computer Science Department, Australian National University Press, Canberra, 1990.
10. S.E. Payne, The generalized quadrangle with (s; t) = (3; 5), Proceedings of the Twenty->rst Southeastern Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, 1990, Congr. Numer. 77 (1990) 5-29.
11. S.E. Payne, J.A. Thas, Finite Generalized Quadrangles, Pitman, Boston, 1984.
12. M. SchZonert, et al., GAP: Groups, Algorithms and Programming, Aachen, April 1992.
13. W.D. Wallis, Construction of strongly regular graphs using aLne designs, Bull. Austr. Math. Soc. 4 (1971) 41-49.