A remark on the generalized spectral characterization of the disjoint union of graphs
From MaRDI portal
Publication:503776
DOI10.1016/j.laa.2016.12.024zbMath1354.05083OpenAlexW2564575000MaRDI QIDQ503776
Publication date: 23 January 2017
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2016.12.024
Related Items (1)
Cites Work
- Unnamed Item
- A simple arithmetic criterion for graphs being determined by their generalized spectra
- Generalized spectral characterization of graphs revisited
- An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra
- Developments on spectral characterizations of graphs
- Which graphs are determined by their spectrum?
- Controllable subsets in graphs
- A new method for constructing graphs determined by their generalized spectrum
- On the generalized spectral characterization of graphs having an isolated vertex
- A sufficient condition for a family of graphs being determined by their generalized spectra
This page was built for publication: A remark on the generalized spectral characterization of the disjoint union of graphs