Generalized spectral characterization of graphs revisited
From MaRDI portal
Publication:396911
zbMath1298.05214arXiv1309.6090MaRDI QIDQ396911
Publication date: 14 August 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.6090
Related Items (30)
Unlocking the walk matrix of a graph ⋮ On the generalized \(A_\alpha\)-spectral characterizations of almost \(\alpha\)-controllable graphs ⋮ Spectral characterizations of tournaments ⋮ A simple arithmetic criterion for graphs being determined by their generalized spectra ⋮ A new criterion for almost controllable graphs being determined by their generalized spectra ⋮ Constructing cospectral graphs via a new form of graph product ⋮ Generalized spectral characterization of rooted product graphs ⋮ Generalized spectral characterizations of regular graphs based on graph-vectors ⋮ Generalized spectral characterizations of a new family of noncontrollable graphs ⋮ Proof of a conjecture on the determinant of the walk matrix of rooted product with a path ⋮ The Smith normal form of the walk matrix of the Dynkin graph \(D_n\) for \(n \equiv 0 \pmod{4}\) ⋮ Smith normal form and the generalized spectral characterization of oriented graphs ⋮ Graphs with at most one generalized cospectral mate ⋮ Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\) ⋮ Generalized spectral characterization of mixed graphs ⋮ New families of graphs determined by their generalized spectrum ⋮ On the Smith normal form of walk matrices ⋮ On the generalized spectral characterizations of Eulerian graphs ⋮ A note on the invariant factors of the walk matrix of a graph ⋮ A remark on the generalized spectral characterization of the disjoint union of graphs ⋮ A note on non-\(\mathbb{R}\)-cospectral graphs ⋮ 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 ⋮ A new arithmetic criterion for graphs being determined by their generalized \(Q\)-spectrum ⋮ Constructing cospectral graphs via regular rational orthogonal matrices with level two ⋮ Smith normal form and the generalized spectral characterization of graphs ⋮ A new method for constructing graphs determined by their generalized spectrum ⋮ An improved condition for a graph to be determined by its generalized spectrum ⋮ Distinguishing graphs with zeta functions and generalized spectra
Cites Work
- An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra
- Developments on spectral characterizations of graphs
- On the asymptotic behavior of graphs determined by their generalized spectra
- Which graphs are determined by their spectrum?
- Controllable subsets in graphs
- A sufficient condition for a family of graphs being determined by their generalized spectra
This page was built for publication: Generalized spectral characterization of graphs revisited
