The cospectral equivalence classes of graphs having an isolated vertex
From MaRDI portal
(Redirected from Publication:971680)
Recommendations
- The spectral characterization of graphs of index less than 2 with no path as a component
- The spectral characterization of graphs of index less than 2 with no Z_n as a component.
- On the generalized spectral characterization of graphs having an isolated vertex
- Graphs with few distinct \(D\)-eigenvalues determined by their \(D\)-spectra
- On the spectral characterization of the union of complete multipartite graph and some isolated vertices
Cites work
- scientific article; zbMATH DE number 3480646 (Why is no real title available?)
- scientific article; zbMATH DE number 3512165 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 3794105 (Why is no real title available?)
- scientific article; zbMATH DE number 3394189 (Why is no real title available?)
- Acyclic molecules with greatest HOMO-LUMO separation
- Circulant digraphs determined by their spectra
- Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
- On the generalized spectral characterization of graphs having an isolated vertex
- Ordering graphs with index in the interval \((2, \sqrt{2+\sqrt 5})\)
- Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
- Spectral characterization of the Hamming graphs
- The complement of the path is determined by its spectrum
- The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
- The largest eigenvalue of a graph: A survey
- The spectral characterization of graphs of index less than 2 with no path as a component
- Which graphs are determined by their spectrum?
Cited in
(7)- A factor of non-DS graphs
- On the generalized spectral characterization of graphs having an isolated vertex
- Non-isomorphic graphs with cospectral symmetric powers
- scientific article; zbMATH DE number 5590101 (Why is no real title available?)
- Constructing graphs with given spectrum and the spectral radius at most 2
- Characterizing cospectral vertices via isospectral reduction
- So's conjecture for integral circulant graphs of 4 types
This page was built for publication: The cospectral equivalence classes of graphs having an isolated vertex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q971680)