Interlacing eigenvalues and graphs

Linear Algebra and Its Applications - Tập 226 - Trang 593-616 - 1995
Willem H. Haemers1
1Tilburg University Department of Econometrics P.O. Box 90153 5000 LE Tilburg, The Netherlands

Tài liệu tham khảo

Beker, 1980, 2-designs with an intersection number k – n, J. Combin. Theory Ser. A, 28, 64, 10.1016/0097-3165(80)90059-X Brouwer, 1995, Toughness and spectrum of a graph, Linear Algebra Appl., 226–228, 267, 10.1016/0024-3795(95)00154-J Brouwer, 1989 Brouwer, 1993, The Gewirtz graph—An exercise in the theory of graph spectra, European J. Combin., 14, 397, 10.1006/eujc.1993.1044 Brouwer, 1985, The connectivity of strongly regular graphs, European J. Combin., 6, 215, 10.1016/S0195-6698(85)80030-5 Courant, 1924 Cvetković, 1971, Graphs and their spectra, Publ. Elektrotehn. Fak. Ser. Mat. Fiz., 354–356, 1 Cvetković, 1979 van Dam, 1993, Eigenvalues and the Diameter of Graphs Delorme, 1991, Diameter, covering index, covering radius and eigenvalues, European J. Combin., 12, 95, 10.1016/S0195-6698(13)80076-5 Delsarte, 1977, Spherical codes and designs, Geom. Dedicata, 6, 363, 10.1007/BF03187604 1991, 68 Ghinelli, 1995, Generalized quadrangles with a regular point and association schemes, Linear Algebra Appl., 226–228, 87, 10.1016/0024-3795(94)00305-W Godsil, 1993 Haemers, 1980, Eigenvalue Techniques in Design and Graph Theory Haemers, 1979, Eigenvalue methods, 15 Haemers, 1992, Distance-Regularity and the Spectrum of Graphs Haemers, 1979, Some remarks on subdesigns of symmetric designs, J. Statist. Plann. Inf., 3, 361, 10.1016/0378-3758(79)90032-6 Helmberg, 1993, A Spectral Approach to Bandwidth and Separator Problems in Graphs, 183 van den Heuvel, 1995, Hamilton cycles and eigenvalues of graphs, Linear Algebra Appl., 226–228 Hoffman, 1970, On eigenvalues and colourings of graphs, 79 Hughes, 1985 Jungnickel, 1982, On subdesigns of symmetric designs, Math. Z., 181, 383, 10.1007/BF01161985 Lander, 1983, Symmetric Designs: An Algebraic Approach, 10.1017/CBO9780511662164 Lovász, 1979, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, IT-25, 1, 10.1109/TIT.1979.1055985 Lovász, 1979 Majumdar, 1953, On some theorems in combinatorics relating to incomplete block designs, Ann. Math. Statist., 24, 379, 10.1214/aoms/1177728978 Manolopoulos, 1992, Electronic stability of fullerenes: eigenvalue theorems for leapfrog carbon clusters, J. Chem. Soc. Faraday Trans., 88, 2427, 10.1039/ft9928802427 Mohar, 1992, A domain monotonicity theorem for graphs and Hamiltonicity, Discrete Appl. Math., 36, 169, 10.1016/0166-218X(92)90230-8 Payne, 1978, An inequality for generalized quadrangles, 71, 147 Payne, 1984, Finite Generalized Quadrangles, 110 Peeters, 1995, Uniqueness of strongly regular graphs having minimal p-rank, Linear Algebra Appl., 226–228, 9, 10.1016/0024-3795(95)00184-S Rivlin, 1990 Seidel, 1979, Strongly regular graphs, 157