A sufficient condition for a family of graphs being determined by their generalized spectra
From MaRDI portal
Publication:2493103
DOI10.1016/j.ejc.2005.05.004zbMath1092.05050OpenAlexW2046206776MaRDI QIDQ2493103
Publication date: 9 June 2006
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2005.05.004
Related Items (41)
On the generalized spectral characterization of graphs having an isolated vertex ⋮ Unlocking the walk matrix of a graph ⋮ On the generalized \(A_\alpha\)-spectral characterizations of almost \(\alpha\)-controllable graphs ⋮ An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra ⋮ On strongly asymmetric and controllable primitive graphs ⋮ 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 ⋮ Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal ⋮ Constructing cospectral graphs via a new form of graph product ⋮ Controllable subsets in graphs ⋮ Generalized spectral characterization of graphs revisited ⋮ Graphs determined by their generalized characteristic polynomials ⋮ 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 ⋮ Smith normal form and the generalized spectral characterization of oriented graphs ⋮ On a theorem of Godsil and McKay concerning the construction of cospectral graphs ⋮ Spectral theory of the non-backtracking Laplacian for graphs ⋮ Graphs with at most one generalized cospectral mate ⋮ Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\) ⋮ THE SPECTRAL DETERMINATIONS OF THE JOIN OF TWO FRIENDSHIP GRAPHS ⋮ Generalized spectral characterization of mixed graphs ⋮ New families of graphs determined by their generalized spectrum ⋮ The spectral characterizations of the connected multicone graphs Kw ▽ LHS and Kw ▽ LGQ(3,9) ⋮ On the generalized spectral characterizations of Eulerian graphs ⋮ The overgraphs of generalized cospectral controllable graphs ⋮ A remark on the generalized spectral characterization of the disjoint union of graphs ⋮ On the spectral determinations of the connected multicone graphs ⋮ Construction of graphs with distinct eigenvalues ⋮ 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 ⋮ Developments on spectral characterizations of graphs ⋮ A new arithmetic criterion for graphs being determined by their generalized \(Q\)-spectrum ⋮ On the asymptotic behavior of graphs determined by their generalized spectra ⋮ Smith normal form and the generalized spectral characterization of graphs ⋮ The connectivity and the spectral radius of commuting graphs on certain finite groups ⋮ A new method for constructing graphs determined by their generalized spectrum ⋮ An improved condition for a graph to be determined by its generalized spectrum ⋮ Main Q-eigenvalues and generalized Q-cospectrality of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spektren endlicher Grafen
- Recent results in the theory of graph spectra
- Which graphs are determined by their spectrum?
- Enumeration of cospectral graphs.
- The complement of the path is determined by its spectrum
- Some results on graph spectra
- Asymptotic enumeration of Latin rectangles
- Large families of cospectral graphs
- No starlike trees are cospectral
This page was built for publication: A sufficient condition for a family of graphs being determined by their generalized spectra
