Spectral characterization of mixed extensions of small graphs

DOI10.1016/j.disc.2018.02.005zbMath1417.05119arXiv1712.01749OpenAlexW2964204169MaRDI QIDQ2317641

Willem H. Haemers

Publication date: 12 August 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.01749

zbMATH Keywords

graph spectrumspectral characterization

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (6)

Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\) ⋮ On two problems related to anti-adjacency (eccentricity) matrix ⋮ Signed graphs with all but two eigenvalues equal to \(\pm 1\) ⋮ On graphs with exactly one anti-adjacency eigenvalue and beyond ⋮ On the spectral characterization of mixed extensions of \(P_3\) ⋮ Spectral determination of graphs with one positive anti-adjacency eigenvalue

Cites Work

• Unnamed Item
• Unnamed Item
• Spectra of graphs
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• The graphs with all but two eigenvalues equal to \(-2\) or 0
• Bipartite graphs with at most six non-zero eigenvalues
• On the nullity of bipartite graphs

This page was built for publication: Spectral characterization of mixed extensions of small graphs