Spectral graph theory and the inverse eigenvalue problem of a graph

Electronic Journal of Linear Algebra

Volumn 14, Issue , 2005, Pages 12-31

  Hogben, Leslie ^a  

^a IOWA STATE UNIVERSITY   (United States)

Author keywords

Colin de Verdi re Matrix; Generalized Laplacian; Inverse Eigenvalue Problem; Minimum Rank; Spectral Graph Theory

Indexed keywords

EID: 14744281927     PISSN: 10813810     EISSN: 10813810     Source Type: Journal    
DOI: 10.13001/1081-3810.1174     Document Type: Conference Paper

References (29)

1. F. Barioli and S. M. Fallat. On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices. Electronic Journal of Linear Algebra, 11:41-50, 2004.
2. F. Barioli, S. Fallat, and L. Hogben. Computation of minimal rank and path cover number for graphs. Linear Algebra and its Applications, 392:289-303, 2004.
3. F. Barioli, S. Fallat, and L. Hogben. On the difference between the maximum multiplicity and path cover number for tree-like graphs. To appear in Linear Algebra and its Applications.
4. W. W. Barrett, H. van der Holst, and R. Loewy. Graphs whose minimal rank is two. Electronic Journal of Linear Algebra, 11:258-280, 2004.
5. R. A. Brualdi and H. J. Ryser. Combinatorial Matrix Theory. Cambridge University Press, Cambridge, 1991.
6. F. R. K. Chung. Spectral Graph Theory, CBMS 92, American Mathematical Society, Providence, 1997.
7. Y. Colin de Verdière. On a new graph invariant and a criterion for planarity. In Graph Structure Theory, pp. 137-147. Contemporary Mathematics 147, American Mathematical Society, Providence, 1993.
8. Y. Colin de Verdière. Multiplicities of eigenvalues and tree-width graphs. Journal of Combinatorial Theory, Series B, 74:121-146, 1998.
9. D. M. Cvetcović, M. Doob, I. Gutman, and A. Torgasěv Recent Results in the Theory of Graph Spectra. North-Holland, Amsterdam, 1988.
10. D. M. Cvetcović, M. Doob, and H. Sachs Spectra of Graphs. Academic Press, Inc., New York, 1980.
11. D. Cvetcović, P. Rowlinson, and S. Simić Eigenspaces of graphs. Cambridge University Press, Cambridge, 1997.
12. E. R. van Dam and W. H. Haemers. Which graphs are determined by their spectrum? Linear Algebra and its Applications, 373:241-272, 2003.
13. M. Fiedler. A characterization of tridiagonal matrices. Linear Algebra and its Applications, 2:191-197, 1969.
14. M. Fiedler. Algebraic connectivity in graphs. Czechoslovak Mathematical Journal, 23:298-305, 1973.
15. C. Godsil and G. Royle Algebraic Graph Theory. Springer-Verlag, New York, 2001.
16. L. Hogben. Spectral graph theory and the inverse eigenvalue of a graph. Presentation at Directions in Combinatorial Matrix Theory Workshop, Banff International Research Station, May 7-8, 2004.
17. H. van der Holst, L. Lovász, and A. Shrijver. The Colin de Verdière graph parameter. In Graph Theory and Computational Biology (Balatonlelle, 1996), pp. 29-85. Mathematical Studies, Janos Bolyai Math. Soc., Budapest, 1999.
18. R. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, 1985.
19. C. R. Johnson and A. Leal Duarte. The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree. Linear and Multilinear Algebra, 46:139-144, 1999.
20. C. R. Johnson and A. Leal Duarte. On the possible multiplicities of the eigenvalues of a Hermitian matrix the graph of whose entries is a tree. Linear Algebra and its Applications, 348:7-21, 2002.
21. C. R. Johnson, A. Leal Duarte, and C. M. Saiago. Inverse Eigenvalue problems and lists of multiplicities for matrices whose graph is a tree: the case of generalized stars and double generalized stars. Linear Algebra and its Applications, 373:311-330, 2003.
22. C. R. Johnson, A. Leal Duarte, and C. M. Saiago. The Parter-Wiener theorem: refinement and generalization. SIAM Journal on Matrix Analysis and Applications, 25:311-330, 2003.
23. C. R. Johnson, A. Leal Duarte, C. M. Saiago, B. D. Sutton, and A. J. Witt. On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with given graph. Linear Algebra and its Applications, 363:352-361, 2003.
24. C. R. Johnson and C. M Saiago. Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of the matrix. Electronic Journal of Linear Algebra, 9:27-31, 2002.
25. A. Leal Duarte and C. R. Johnson. On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree. Mathematical Inequalities and Applications, 5:175-180, 2002.
26. Z. Li. On Minimum Ranks of Sign Pattern Matrices. Presentation at Directions in Combinatorial Matrix Theory Workshop, Banff International Research Station, May 7-8, 2004.
27. S. Parter. On the eigenvalues and eigenvectors of a class of matrices. Journal of the Society for Industrial and Applied Mathematics, 8:376-388, 1960.
28. A. J. Schwenk. Almost all trees are cospectral. In New Directions in the Theory of Graphs (Proc. Third Ann Arbor Conference at the University of Michigan), pp. 275-307. Academic Press, New York, 1973.
29. G. Wiener. Spectral multiplicity and splitting results for a class of qualitative matrices. Linear Algebra and its Applications, 61:15-29, 1984.