The Laplacian spectrum of a graph consists of the eigenvalues (together with multiplicities) of the Laplacian matrix. In this article we determine, among the graphs consisting of disjoint unions of paths and cycles, those ones which are determined by the Laplacian spectrum. For the graphs, which are not determined by the Laplacian spectrum, we give the corresponding cospectral non-isomorphic graphs.

Laplacian spectral characterization of disjoint union of paths and cycles

BELARDO, Francesco;
2011

Abstract

The Laplacian spectrum of a graph consists of the eigenvalues (together with multiplicities) of the Laplacian matrix. In this article we determine, among the graphs consisting of disjoint unions of paths and cycles, those ones which are determined by the Laplacian spectrum. For the graphs, which are not determined by the Laplacian spectrum, we give the corresponding cospectral non-isomorphic graphs.
File in questo prodotto:
File Dimensione Formato  
Laplacian spectral characterization of disjoint union of paths and cycles.pdf

non disponibili

Descrizione: Articolo completo in Post-print
Tipologia: Documento in Post-print
Licenza: Accesso privato/ristretto
Dimensione 156.85 kB
Formato Adobe PDF
156.85 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11588/620321
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 8
  • ???jsp.display-item.citation.isi??? 7
social impact