共 50 条
On the Laplacian integral tricyclic graphs
被引:8
|作者:
Huang, Xueyi
[1
]
Huang, Qiongxiang
[1
]
Wen, Fei
[1
]
机构:
[1] Xinjiang Univ, Coll Math & Syst Sci, Urumqi, Peoples R China
关键词:
tricyclic graph;
Laplacian integral graph;
algebraic connectivity;
05C50;
R-PARTITE GRAPHS;
ALGEBRAIC CONNECTIVITY;
EIGENVALUES;
MATRICES;
SPECTRUM;
D O I:
10.1080/03081087.2014.936436
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
A graph is called Laplacian integral if all its Laplacian eigenvalues are integers. In this paper, we give an edge subdividing theorem for Laplacian eigenvalues of a graph (Theorem 2.1) and characterize a class of k-cyclic graphs whose algebraic connectivity is less than one. Using these results, we determine all the Laplacian integral tricyclic graphs. Furthermore, we show that all the Laplacian integral tricyclic graphs are determined by their Laplacian spectra.
引用
收藏
页码:1356 / 1371
页数:16
相关论文