Published in

Elsevier, Computers and Mathematics with Applications, 12(59), p. 3849-3857, 2010

DOI: 10.1016/j.camwa.2010.04.021

Links

Tools

Export citation

Search in Google Scholar

Spectral determination of graphs whose components are paths and cycles

Journal article published in 2010 by Dragoš Cvetković, Slobodan K. Simić, Zoran Stanić ORCID
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

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.