On the algebraic theory of pseudo-distance-regularity around a set

Linear Algebra and Its Applications

Volumn 298, Issue 1-3, 1999, Pages 115-141

  Fiol, M A ^a   Garriga, E ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Completely regular code; Distance regular graph; Local spectrum; Orthogonal polynomials

Indexed keywords

EID: 0033454515     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(99)00154-8     Document Type: Article

References (41)

1. 1, Isoperimetric inequalities for graphs and superconcentrators, J. Combin. Theory Ser. B 38 (1985) 73-88.
2. E. Bannai, T. Ito, Algebraic Combinatorics I: Association Schemes, Benjamin-Cummings Lecture Note Ser, 58, London, 1984.
3. N. Biggs, Algebraic Graph Theory, Cambridge University Press, Cambridge, 1974, second edition, 1993.
4. A.E. Brouwer, A.M. Cohen, A. Neumaier, Distance-Regular Graphs, Springer, Berlin, 1989.
5. F.R.K. Chung, Diameter and eigenvalues, J. Amer. Math. Soc. 2 (2) (1989) 187-196.
6. F.R.K. Chung, A. Grigor'yan, S.-T. Yau, Upper bounds for eigenvalues of the discrete and continuous Laplace operators, Adv. Math. 117 (2) (1996) 165-178.
7. B. Courteau, A. Montpetit, Dual distances of completely regular codes, Discrete Math. 89 (1991) 7-15.
8. D.M. Cvetković, Spectrum of the graph of n-tuples, Publ. Elektrotehn. Fak. Univ. Beograd, Ser. Mat. Fiz. 274-301 (1969) 91-95.
9. D.M. Cvetković, M. Doob, H. Sachs, Spectra of Graphs - Theory and Applications, Deutscher Verlag der Wissenschaften, Berlin, 1980; Academic Press, New York, 1980; second edition: 1982; Russian translation: Naukova Dumka, Kiev, 1984.
10. E.R. van Dam, W.H. Haemers, Eigenvalues and the diameter of graphs, Linear and Multilinear Algebra 39 (1995) 33-44.
11. E.R. van Dam, W.H. Haemers, A characterization of distance-regular graphs with diameter three, J. Algebraic Combin. 6 (3) (1997) 299-303.
12. C. Delorme, P. Solé, Diameter, covering index, covering radius and eigenvalues, European J. Combin. 12 (1991) 95-108.
13. C. Delorme, J.P. Tillich, Eigenvalues, eigenspaces and distances to subsets, Discrete Math. 165-166 (1-3) (1997) 161-184.
14. P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Research Reports Supplements, 1973, p. 10.
15. M.A. Fiol, Weight odd parameters and spectra of graphs, in: Combinatorics, Graph Theory, and Algorithms, vol. 1,2 (Kalamazoo, MI, 1996), New Issues Press, Kalamazoo, 1999, pp. 401-410.
16. M.A. Fiol, Eigenvalue interlacing and weight parameters of graphs, Linear Algebra Appl. 290 (1-3) (1999) 275-301.
17. M.A. Fiol, E. Garriga, The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs, Discrete Appl. Math. 87 (1-3) (1998) 77-97.
18. M.A. Fiol, E. Garriga, From local adjacency polynomials to locally pseudo-distance-regular graphs, J. Combin. Theory Ser. B 71 (1997) 162-183.
19. 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.
20. M.A. Fiol, E. Garriga, J.L.A. Yebra, From regular boundary graphs to antipodal distance-regular graphs, J. Graph Theory 27 (1998) 123-140.
21. M.A. Fiol, E. Garriga, J.L.A. Yebra, Locally pseudo-distance-regular graphs, J. Combin. Theory Ser. B J. Combin. Theory Ser. B 68 (1996) 179-205.
22. M.A. Fiol, E. Garriga, J.L.A. Yebra, The alternating polynomials and their relation with the spectra and conditional diameters of graphs, Discrete Math. 167-168 (1-3) (1997) 297-307.
23. E. Garriga, Contribució a la Teoria Espectral de Grafs. Problemes Mètrics i Distància-Regularitat, Ph.D. Thesis, Universitat Politècnica de Catalunya, Barcelona, 1997.
24. C.D. Godsil, Algebraic Combinatorics, Chapman & Hall, London/New York, 1993.
25. C.D. Godsil, B.D. McKay, Feasibility conditions for the existence of walk-regular graphs, Linear Algebra Appl. 30 (1980) 51-61.
26. W.H. Haemers, Distance-regularity and the spectrum of graphs, Linear Algebra Appl. 236 (1996) 265-278
27. T. Hilano, K. Nomura, Distance degree regular graphs, J. Combin. Theory Ser. B 37 (1984) 96-100.
28. A.J. Hoffman, On the polynomial of a graph, Amer. Math. Monthly 70 (1963) 30-36.
29. W.J. Martin, Completely Regular Subsets. Ph.D. Thesis, University of Waterloo, Waterloo, 1992.
30. B.D. McKay, Backtrack Programming and the Graph Isomorphism Problem, M.Sc. Thesis, University of Melbourne, 1976.
31. B. Mohar, Eigenvalues, diameter and mean distance in graphs, Graphs Combin. 7 (1991) 53-64.
32. A Neumaier, Completely regular codes, Discrete Math. 106/107 (1992) 353-360.
33. A.F. Nikiforov, S.K. Suslov, V.B. Uvarov, Classical Orthogonal Polynomials of a Discrete Variable, Springer, Berlin, 1991.
34. G. Quenell, Spectral diameter estimates for k-regular graphs, Adv. Math. 106 (1994) 122-148.
35. P.C. Sarnak, Some Applications of Modular Forms, Cambridge University Press, Cambridge, 1990.
36. A.J. Schwenk, Computing the characteristic polynomial of a graph, in: Graphs and Combinatorics, Lecture Notes in Mathematics 406, Springer, Berlin, 1974, pp. 153-162.
37. P. Terwilliger, The subconstituent algebra of an association scheme (part I), J. Algebraic. Combin. 1 (1992) 363-388.
38. P. Terwilliger, The subconstituent algebra of an association scheme (part II), J. Algebraic. Combin. 2 (1993) 73-103.
39. P. Terwilliger, The subconstituent algebra of an association scheme (part III), J. Algebraic. Combin. 2 (1993) 177-210
40. P. Terwilliger, Algebraic Graph Theory, forthcoming.
41. P.M. Weichsel, On distance-regularity in graphs, J. Combin. Theory Ser. B 32 (1982) 156-161.