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 / Wang, J. F.; Simić, S. K.; Huang, Q. X.; Belardo, Francesco; Li Marzi, E. M.. - In: LINEAR & MULTILINEAR ALGEBRA. - ISSN 0308-1087. - 59:5(2011), pp. 531-539. [10.1080/03081081003605777]
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 | 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.
