One special double starlike graph is det
โ
Xiaogang Liu; Yuanping Zhang; Pengli Lu
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 394 KB
A tree is called double starlike if it has exactly two vertices of degree greater than 2. We denote by H n (p, p) (n โฅ 2, p โฅ 1) one special double starlike graph. In this work, graph H n (p, p) will be proved to be determined by its Laplacian spectrum.