Eigenvalue interlacing and weight parameters of graphs

Linear Algebra and Its Applications

Volumn 290, Issue 1-3, 1999, Pages 275-301

  Fiol, M A ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040884791     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(98)10238-0     Document Type: Article

References (35)

1. C. Balbuena, A. Carmona, J. Fàbrega, M.A. Fiol, On the connectivity and the conditional diameter of graphs and digraphs, Networks 28 (1996) 97-105.
2. E. Bannai, T. Ito, Algebraic Combinatorics I: Association Schemes, Benjamin-Cummings Lecture Note Ser. 58, Benjamin/Cummings, London, 1984.
3. N. Biggs, Some odd graph theory, Annals New York Acad. Sci. 319, New York, 1979, pp. 71-81.
4. N. Biggs, Algebraic Graph Theory, Cambridge University Press, Cambridge, 1974; 2nd ed., 1993.
5. I. Bond, C. Delorme, New large bipartite graphs with given degree and diameter, Ars Combin. 25C (1988) 123-132.
6. A.E. Brouwer, A.M. Cohen, A. Neumaier, Distance-Regular Graphs, Springer, Berlin, 1989.
7. F.R.K. Chung, C. Delorme, P. Solé, k-Diameter and spectral multiplicity, submitted.
8. F.R.K. Chung, A. Grigor'yan, S.-T. Yau, Upper bounds for eigenvalues for the discrete and continuous Laplace operators, Adv. Math. 117 (1996) 165-178.
9. R. Courant, D. Hilbert, Methoden der Mathematischen Physik, vol. 1, Springer, Berlin, 1924.
10. E.R. van Dam, Graphs with Few Eigenvalues, Ph.D. Thesis, Tilburg University, Tilburg, 1996.
11. E.R. van Dam, Bounds on special subsets in graphs, eigenvalues and association schemes, J. Algebraic Combin. 7 (3) (1998) 321-332.
12. E.R. van Dam, W.H. Haemers, Eigenvalues and the diameter of graphs, Linear and Multilinear Algebra 39 (1995) 33-44.
13. C. Delorme, J.P. Tillich, Eigenvalues, eigenspaces and distances to subsets, Discrete Math. 165-166 (1-3) (1997) 161-184.
14. M.A. Fiol, Weight odd parameters and spectra of graphs, in: Eighth Quadrennial International Conference on Graph Theory, Combinatorics, Algorithms, and Applications, vol. 1,2, Kalamazoo, MI, USA, 1996, Wiley, New York, 1998, pp. 401-410.
15. M.A. Fiol, An eigenvalue characterization of antipodal distance-regular graphs, Electron. J. Combin. 4 (1) (1997) #R30.
16. 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.
17. M.A. Fiol, E. Garriga, Pseudo-distance-regularity around a set, orthogonal polynomials, and completely regular codes, submitted.
18. 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.
19. M.A. Fiol, E. Garriga, J.L.A. Yebra, Boundary graphs: The limit case of a spectral property, submitted.
20. 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.
21. 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.
22. C.D. Godsil, Algebraic Combinatorics, Chapman and Hall, London/New York, 1993.
23. C.D. Godsil, B.D. McKay, Feasibility conditions for the existence of walk-regular graphs, Linear Algebra Appl. 30 (1980) 51-61.
24. W.H. Haemers, Eigenvalue methods, in: A. Schrijver (Ed.), Packing and Covering in Combinatorics, Math. Centre Tract 106, Mathematical Centre, Amsterdam, 1979, pp. 15-38.
25. W.H. Haemers, Eigenvalue Techniques in Design and Graph Theory, Math. Centre Tract 121, Mathematical Centre, Amsterdam, 1980.
26. W.H. Haemers, Interlacing eigenvalues and graphs, Linear Algebra Appl. 226-228 (1995) 593-616.
27. A.J. Hoffman, On eigenvalues and coloring of graphs, in: B. Harris (Ed.), Graph Theory and its Applications, Academic Press, New York, 1970, pp. 79-91.
28. N. Kahale, Isoperimetric inequalities and eigenvalues, SIAM J. Discrete Math. 10 (1) (1997) 30-40.
29. D.K. Knuth, The sandwich theorem. Electron. J. Combin. 1 (1994) #A1.
30. L. Lovász. On the Shannon capacity of a graph, IEEE Trans. Inform. Theory IT-25 (1) (1979) 1-7.
31. L. Lovász, Combinatorial Problems and Exercises, North-Holland, Amsterdam, 1979.
32. B.D. McKay, Backtrack Programming and the Graph Isomorphism Problem, M.Sc. Thesis, University of Melbourne, 1976.
33. B. Mohar, The Laplacian spectrum of graphs, in: Y. Alavi et. al. (Eds.). Graph Theory, Combinatorics and Applications, vol. 2, Wiley, New York, 1991, pp. 871-898.
34. J.A. Rodríguez, Cotas de Diversos Paramétros de un Grafo a Partir de los Autovalores de su Matriz Laplaciana Ph.D. Thesis, Universitat Politècnica de Catalunya, Barcelona, 1997.
35. C.E. Shannon, The zero-error capacity of a noisy channel, IRE Trans. Inform. Theory IT-2 (3) (1956) 8-19.