Algebraic characterizations of distance-regular graphs

Discrete Mathematics

Volumn 246, Issue 1-3, 2002, Pages 111-129

  Fiol, M A ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Adjacency matrix; Distance regular graph; Spectrum

Indexed keywords

EID: 31244435204     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(01)00255-2     Document Type: Article

References (30)

1. E. Bannai, T. Ito, Algebraic Combinatorics I: Association Schemes., Benjamin/Cummings, Menlo Park, CA, 1984.
2. N. Biggs, Intersection matrices for linear graphs, in: D.J.A. Welsh (Ed.), Combinatorial Mathematics and its Applications, Academic Press, London, 1971, pp. 15-23.
3. N. Biggs, An edge-colouring problem, Amer. Math. Monthly 79 (1972) 1018-1020.
4. N. Biggs, Some odd graph theory, Ann. New York Acad. Sci. 319 (1979) 71-81.
5. N. Biggs, Algebraic Graph Theory (2nd Edition, 1993), Cambridge University Press, Cambridge, 1974.
6. A.E. Brouwer, A.M. Cohen, A. Neumaier, Distance-Regular Graphs, Springer, Berlin, 1989.
7. A.E. Brouwer, W.H. Haemers, Association schemes, in: Handbook of Combinatorics, Vols. 1,2, Elsevier, Amsterdam, 1995, pp. 747-771.
8. D. Cvetkovic, P. Rowlinson, S. Simic, Eigenspaces of Graph, Cambridge University Press, Cambridge, 1997.
9. E.R. van Dam, Bounds on special subsets in graphs, eigenvalues and association schemes, J. Algebraic Combin. 7 (3) (1998) 321-332.
10. E.R. van Dam, W.H. Haemers, A characterization of distance-regular graphs with diameter three, J. Algebraic Combin. 6 (3) (1997) 299-303.
11. R.M. Damerell, On Moore graphs, Proc. Cambridge Philos. Soc. 74 (1973) 227-236.
12. M.A. Fiol, An eigenvalue characterization of antipodal distance-regular graphs, Electron. J. Combin. 4 (1) (1997) #R30.
13. M.A. Fiol, Some spectral characterizations of strongly distance-regular graphs, Combin. Probab. Comput. 10 (2001) 127-135.
14. M.A. Fiol, On pseudo-distance-regularity, Linear Algebra Appl. 323 (2001) 145-165.
15. M.A. Fiol, E. Garriga, From local adjacency polynomials to locally pseudo-distance-regular graphs, J. Combin. Theory Ser. B 71 (1997) 162-183.
16. M.A. Fiol, E. Garriga, Strong pseudo-regularity around a set, Linear Multilinear Algebra, to appear.
17. M.A. Fiol, E. Garriga, J.L.A. Yebra, On a class of polynomials and its relation with the spectra and diameters of graphs, J. Combin. Theory Ser. B 67 (1996) 48-61.
18. M.A. Fiol, E. Garriga, J.L.A. Yebra, Locally pseudo-distance-regular graphs, J. Combin. Theory Ser. B 68 (1996) 179-205.
19. M.A. Fiol, E. Garriga, J.L.A. Yebra, From regular boundary graphs to antipodal distance-regular graphs, J. Graph Theory 27 (3) (1998) 123-140.
20. M.A. Fiol, E. Garriga, J.L.A. Yebra, Boundary graphs: the limit case of a spectral property, Discrete Math. 226 (2001) 155-173.
21. E. Garriga, Contribuciô a la Teoria Espectral de Grafs. Problèmes Metrics i Distància-Regularitat, Ph.D. Thesis, Universität Politècnica de Catalunya, Barcelona, 1997.
22. C.D. Godsil, Bounding the diameter of distance regular graphs, Combinatorica 8 (1988) 333-343.
23. C.D. Godsil, Algebraic Combinatorics, Chapman & Hall, New York, 1993.
24. W.H. Haemers, Distance-regularity and the spectrum of graphs, Linear Algebra Appl. 236 (1996) 265-278.
25. W.H. Haemers, Interlacing eigenvalues and graphs, Linear Algebra Appl. 227/228 (1995) 593-616.
26. W.H. Haemers, E. Spence, Graphs cospectral with distance-regular graphs, Linear and Multilinear Algebra 39 (1-2) (1995) 91-107.
27. N. Hajaj, On the spectrum, the growth, and the diameter of a graph, J. Combin. Theory Ser. B 76 (1) (1999) 1-21.
28. A.J. Hoffman, On the polynomial of a graph, Amer. Math. Monthly 70 (1963) 30-36.
29. A. Moon, Characterization of the odd graphs Ot by parameters, Discrete Math. 42 (1) (1982) 91-97.
30. P. Rowlinson, Linear algebra, in: L.W. Beineke, R.J. Wilson (Eds.), Graph Connections, Oxford Lecture Series in Mathematical Applications, Vol. 5, Oxford Univ. Press, New York, 1997, pp. 86-99.