| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4599976 | Linear Algebra and its Applications | 2013 | 7 Pages |
Abstract
A 3-rose graph is a graph consisting of three cycles intersecting in a common vertex, J. Wang et al. showed all 3-rose graphs with at least one triangle are determined by their Laplacian spectra. In this paper, we complete the above Laplacian spectral characterization and prove that all 3-rose graphs are determined by their Laplacian spectra.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Fenjin Liu, Qiongxiang Huang,