Spectral determination of graphs whose components are paths and cycles


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… (More)
DOI: 10.1016/j.camwa.2010.04.021


2 Figures and Tables

Slides referencing similar topics