Haemers’ Conjecture: An Algorithmic Perspective

DOI10.1080/10586458.2024.2337229MaRDI QIDQ6972464zbMATH OpenFDO

Authors Wei Wang, Wei Wang

Publication date 12 June 2025

Published in Experimental Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10586458.2024.2337229

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Cites work

• A new criterion for almost controllable graphs being determined by their generalized spectra
• A note on cospectral graphs
• A simple arithmetic criterion for graphs being determined by their generalized spectra
• A sufficient condition for a family of graphs being determined by their generalized spectra
• Almost controllable graphs and beyond
• An improved condition for a family of trees being determined by their generalized spectrum
• An improved condition for a graph to be determined by its generalized spectrum
• Controllable subsets in graphs
• Cospectral graphs and regular orthogonal matrices of level 2
• Cospectral graphs on 12 vertices
• Developments on spectral characterizations of graphs
• Enumeration of cospectral graphs.
• Further results on almost controllable graphs
• Generalized spectral characterization of graphs revisited
• Generalized spectral characterizations of almost controllable graphs
• Graphs with \(n - 1\) main eigenvalues
• Graphs with at most one generalized cospectral mate
• scientific article; zbMATH DE number 1703931 (Why is no real title available?)
• scientific article; zbMATH DE number 3556153 (Why is no real title available?)
• scientific article; zbMATH DE number 3401090 (Why is no real title available?)
• Modern computer algebra
• On a Conjecture of Godsil Concerning Controllable Random Graphs
• On the generalized A_-spectral characterizations of almost -controllable graphs
• On the generalized spectral characterizations of Eulerian graphs
• Smith normal form and the generalized spectral characterization of graphs
• Unlocking the walk matrix of a graph
• Which graphs are determined by their spectrum?

Cited in

(5)

• On the determinant of the walk matrix of the rooted product with a path
• Cokernel statistics for walk matrices of directed and weighted random graphs
• On the Smith normal form of Q-walk matrix
• Generalized spectral characterization of signed bipartite graphs
• Primary decomposition theorem and generalized spectral characterization of graphs

This page was built for publication: Haemers’ Conjecture: An Algorithmic Perspective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6972464)