哈尔滨工程大学学报2012，Vol.33Issue(7)：851-854,4.DOI:10.3969/j.issn.1006-7043.201107038
一类单圈图的Laplacian谱刻画
Characterizing some class of unicyclic graph by its Laplacian spectrum
摘要
Abstract
It is difficult to determine which graphs can be determined by their spectra.Based on lollipop graph and graph H(n;q,n1,n2),a new family of graphs was defined and denoted by H(n;q,n1,n2,n3),which was a graph of order n obtained by attaching three hanging paths Pn1,Pn2 and Pn3 at the same vertex of cycle Cq.First,it was proven that if two graphs in the family of the graphs are non-isomorphic,they must have different Laplacian spectra.Then,it was proven that the graph H(n;q,n1,n2,n3) is determined by its Laplacian spectrum.关键词
Laplacian矩阵/Laplacian特征多项式/L-同谱/L-谱Key words
Laplacian matrix/Laplacian characteristic polynomial/L-cospectral/L-spectrum分类
数理科学引用本文复制引用
卢鹏丽,王旭柱,陈作汉..一类单圈图的Laplacian谱刻画[J].哈尔滨工程大学学报,2012,33(7):851-854,4.基金项目
国家自然科学基金资助项目(61064011) （61064011）
兰州理工大学校基金资助项目(0914ZX136). （0914ZX136）
