Interlacing eigenvalues and graphs

Linear Algebra and Its Applications

Volumn 226-228, Issue C, 1995, Pages 593-616

  Haemers, Willem H ^a  

^a TILBURG UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 22044432097     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/0024-3795(95)00199-2     Document Type: Article

References (34)

1. 2-designs with an intersection number k – n
2. Toughness and spectrum of a graph
3. The Gewirtz graph—An exercise in the theory of graph spectra
4. The connectivity of strongly regular graphs
5. Graphs and their spectra
6. Eigenvalues and the Diameter of Graphs
7. Diameter covering index covering radius and eigenvalues
8. Spherical codes and designs
9. Generalized quadrangles with a regular point and association schemes
10. Eigenvalue Techniques in Design and Graph Theory
11. Eigenvalue methods
12. Distance-Regularity and the Spectrum of Graphs
13. Some remarks on subdesigns of symmetric designs
14. A Spectral Approach to Bandwidth and Separator Problems in Graphs
15. Hamilton cycles and eigenvalues of graphs
16. On eigenvalues and colourings of graphs
17. On subdesigns of symmetric designs
18. Symmetric Designs: An Algebraic Approach
19. On the Shannon capacity of a graph
20. On some theorems in combinatorics relating to incomplete block designs
21. Electronic stability of fullerenes: eigenvalue theorems for leapfrog carbon clusters
22. A domain monotonicity theorem for graphs and Hamiltonicity
23. An inequality for generalized quadrangles
24. Finite Generalized Quadrangles
25. Uniqueness of strongly regular graphs having minimal p-rank
26. Strongly regular graphs