A rose graph with p petals (or p-rose graph) is a graph obtained by taking p cycles with just a vertex in common. In this paper, we prove that all 3-rose graphs, having at least one triangle, are determined by their Laplacian spectra and all 3-rose graphs are determined by their signless Laplacian spectra.
On the spectral characterizations of 3-rose graphs
BELARDO, FRANCESCO
2013-01-01
Abstract
A rose graph with p petals (or p-rose graph) is a graph obtained by taking p cycles with just a vertex in common. In this paper, we prove that all 3-rose graphs, having at least one triangle, are determined by their Laplacian spectra and all 3-rose graphs are determined by their signless Laplacian spectra.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.