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 axe determined by their signless Laplacian spectra.
On the spectral characterizations of 3-rose graphs / Wang, Jianfeng; Huang, Qiongxiang; Belardo, Francesco. - In: UTILITAS MATHEMATICA. - ISSN 0315-3681. - 91:(2013), pp. 33-46.
On the spectral characterizations of 3-rose graphs
BELARDO, Francesco
2013
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 axe determined by their signless Laplacian spectra.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
On the spectral characterizations of 3-rose graphs.pdf
accesso aperto
Descrizione: Articolo completo in versione post-print
Tipologia:
Documento in Post-print
Licenza:
Dominio pubblico
Dimensione
164.13 kB
Formato
Adobe PDF
|
164.13 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
