Abstract
A clover graph is obtained from a 3-rose graph by attaching a path to the vertex of degree six, where a 3-rose graph consists of three cycles with precisely one common vertex. In this paper, it is proved that all clover graphs are determined by their Laplacian spectra.
| Original language | English |
|---|---|
| Pages (from-to) | 2396-2405 |
| Number of pages | 10 |
| Journal | Linear and Multilinear Algebra |
| Volume | 63 |
| Issue number | 12 |
| DOIs | |
| State | Published - 2 Dec 2015 |
Keywords
- determined by Laplacian spectrum
- Laplacian spectrum