An improved condition for a graph to be determined by its generalized spectrum
From MaRDI portal
Publication:2107506
DOI10.1016/j.ejc.2022.103638zbMath1504.05180arXiv2110.09404OpenAlexW4308984300MaRDI QIDQ2107506
Wei Wang, Wei Wang, Fu-hai Zhu
Publication date: 1 December 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.09404
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)
Related Items (2)
Generalized spectral characterizations of a new family of noncontrollable graphs ⋮ The Smith normal form of the walk matrix of the Dynkin graph \(D_n\) for \(n \equiv 0 \pmod{4}\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple arithmetic criterion for graphs being determined by their generalized spectra
- Generalized spectral characterization of graphs revisited
- On the generalized spectral characterizations of Eulerian graphs
- Developments on spectral characterizations of graphs
- A note on cospectral graphs
- Which graphs are determined by their spectrum?
- Oriented graphs determined by their generalized skew spectrum
- An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra
- Generalized spectral characterizations of almost controllable graphs
- Smith normal form and the generalized spectral characterization of graphs
- Generalized spectral characterization of mixed graphs
- On the Smith normal form of walk matrices
- A new arithmetic criterion for graphs being determined by their generalized \(Q\)-spectrum
- A sufficient condition for a family of graphs being determined by their generalized spectra
- Main eigenvalues of a graph
- Modern Computer Algebra
- On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases
This page was built for publication: An improved condition for a graph to be determined by its generalized spectrum
