Authors: Cvetković, Dragoš
Simić, Slobodan 
Stanić, Zoran
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Spectral determination of graphs whose components are paths and cycles
Journal: Computers and Mathematics with Applications
Volume: 59
Issue: 12
First page: 3849
Last page: 3857
Issue Date: 1-Jun-2010
Rank: M21
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2010.04.021
We consider the class of graphs each of whose components is either a path or a cycle. We classify the graphs from the class considered into those which are determined and those which are not determined by the adjacency spectrum. In addition, we compare the result with the corresponding results for the Laplacian and the signless Laplacian spectra. It turns out that the signless Laplacian spectrum performs the best, confirming some expectations from the literature.
Keywords: Cycles | Graph eigenvalues | Paths | Spectral determination
Publisher: Elsevier
Project: Serbian Ministry of Science, Projects 144015D and 144032D

Show full item record


checked on Jun 15, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.