Generalized cospectral graphs with and without Hamiltonian cycles

DOI10.1016/j.laa.2019.10.001zbMath1426.05104OpenAlexW2979735371WikidataQ114664016 ScholiaQ114664016MaRDI QIDQ2332465

Fenjin Liu, Wei Wang, Hong-Jian Lai, Tao Yu

Publication date: 4 November 2019

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2019.10.001

zbMATH Keywords

spectrumHamiltonian cycle\(k\)-(generalized) cospectrally-rooted graphgeneralized cospectral

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Eulerian and Hamiltonian graphs (05C45)

Related Items

On NP-hard graph properties characterized by the spectrum ⋮ Constructions of cospectral graphs with different zero forcing numbers ⋮ An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra ⋮ The smallest pair of cospectral cubic graphs with different chromatic indexes

Cites Work

• Cospectral graphs and regular orthogonal matrices of level 2
• Cospectral regular graphs with and without a perfect matching
• Developments on spectral characterizations of graphs
• A note on cospectral graphs
• Which graphs are determined by their spectrum?
• Enumeration of cospectral graphs.
• Supereulerian graphs and the Petersen graph
• Unnamed Item
• Unnamed Item
• Unnamed Item