Cospectral graphs and the generalized adjacency matrix
From MaRDI portal
Publication:876300
DOI10.1016/J.LAA.2006.07.017zbMath1118.05066OpenAlexW3124501589MaRDI QIDQ876300
Jack H. Koolen, Willem H. Haemers, van Dam, Edwin R.
Publication date: 18 April 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://research.tilburguniversity.edu/en/publications/ccfab5ea-009a-462a-bcdf-71619e4ee933
Related Items (17)
Interlacing eigenvalues and graphs ⋮ On the least distance eigenvalue and its applications on the distance spread ⋮ Two Laplacians for the distance matrix of a graph ⋮ Spectral characterizations of almost complete graphs ⋮ Complete multipartite graphs are determined by their distance spectra ⋮ On the second largest distance eigenvalue of a graph ⋮ A note on non-\(\mathbb{R}\)-cospectral graphs ⋮ Regularity and the generalized adjacency spectra of graphs ⋮ Unnamed Item ⋮ Cospectrality of graphs with respect to distance matrices ⋮ Comparing large-scale graphs based on quantum probability theory ⋮ On the expressive power of linear algebra on graphs ⋮ Developments on spectral characterizations of graphs ⋮ Generalized permanental polynomials of graphs ⋮ Constructing cospectral graphs via regular rational orthogonal matrices with level two ⋮ A new method for constructing graphs determined by their generalized spectrum ⋮ Main Q-eigenvalues and generalized Q-cospectrality of graphs
Uses Software
Cites Work
This page was built for publication: Cospectral graphs and the generalized adjacency matrix