A remark on the generalized spectral characterization of the disjoint union of graphs
From MaRDI portal
(Redirected from Publication:503776)
Recommendations
- An improved condition for a graph to be determined by its generalized spectrum
- Generalized spectral characterization of graphs revisited
- On the generalized spectral characterization of graphs having an isolated vertex
- A simple arithmetic criterion for graphs being determined by their generalized spectra
- A new method for constructing graphs determined by their generalized spectrum
Cites work
- A new method for constructing graphs determined by their generalized spectrum
- 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
- An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra
- Combinatorial matrix theory
- Controllable subsets in graphs
- Developments on spectral characterizations of graphs
- Generalized spectral characterization of graphs revisited
- On the generalized spectral characterization of graphs having an isolated vertex
- Which graphs are determined by their spectrum?
Cited in
(6)- Disjoint unions of complete graphs characterized by their Laplacian spectrum
- A new method for constructing graphs determined by their generalized spectrum
- On the generalized spectral characterization of graphs having an isolated vertex
- Generalized spectral characterization of rooted product graphs
- scientific article; zbMATH DE number 6870675 (Why is no real title available?)
- An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra
This page was built for publication: A remark on the generalized spectral characterization of the disjoint union of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q503776)
