Laplacian spectral characterization of clover graphs

Luhua Wang, Ligong Wang

科研成果: 期刊稿件文章同行评审

4 引用 (Scopus)

摘要

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.

源语言英语
页(从-至)2396-2405
页数10
期刊Linear and Multilinear Algebra
63
12
DOI
出版状态已出版 - 2 12月 2015

指纹

探究 'Laplacian spectral characterization of clover graphs' 的科研主题。它们共同构成独一无二的指纹。

引用此