Spectral determination of graphs whose components are paths and cycles

  • Authors:

  • Dragoš Cvetković;Slobodan K. Simić;Zoran Stanić

  • Affiliations:

  • Mathematical Institute SANU, Kneza Mihaila 36, 11000 Belgrade, Serbia;Mathematical Institute SANU, Kneza Mihaila 36, 11000 Belgrade, Serbia;Faculty of Mathematics, University of Belgrade, Studentski trg 16, 11000 Belgrade, Serbia

  • Venue:
  • Computers & Mathematics with Applications
  • Year:
  • 2010

Quantified Score

Hi-index 0.09

Visualization

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.