Spectral determination of graphs whose components are paths and cycles
From MaRDI portal
Publication:604009
DOI10.1016/j.camwa.2010.04.021zbMath1198.05110OpenAlexW2076972768MaRDI QIDQ604009
Zoran Stanić, Dragos Cvetković, Slobodan K. Simic
Publication date: 8 November 2010
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2010.04.021
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items
Notes on the polynomial reconstruction of signed graphs ⋮ Laplacian spectral characterization of some graph join ⋮ Signless Laplacian spectral characterization of line graphs ofT-shape trees ⋮ Spectral characterizations of almost complete graphs ⋮ Unnamed Item ⋮ Laplacian spectral characterization of some graphs obtained by product operation ⋮ Laplacian spectral characterization of disjoint union of paths and cycles ⋮ Constructing graphs with given spectrum and the spectral radius at most 2 ⋮ On the spectral characterization of Π-shape trees ⋮ A note on non-\(\mathbb{R}\)-cospectral graphs ⋮ On the construction of graphs determined by their generalized characteristic polynomials ⋮ Cospectrality graphs of Smith graphs
Cites Work
- On determination of caterpillars with four terminal vertices by their Laplacian spectrum
- On some forests determined by their Laplacian or signless Laplacian spectrum
- Which graphs are determined by their spectrum?
- Graphs with maximal signless Laplacian spectral radius
- The spectral characterization of graphs of index less than 2 with no path as a component
- Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
- Laplacian spectral characterization of disjoint union of paths and cycles
- Towards an algebra of SINGs
- Towards a spectral theory of graphs based on the signless Laplacian, I
- Unnamed Item
- Unnamed Item
This page was built for publication: Spectral determination of graphs whose components are paths and cycles