One special double starlike graph is determined by its Laplacian spectrum

✍ Scribed by Xiaogang Liu; Yuanping Zhang; Pengli Lu

• Publisher: Elsevier Science
• Year: 2009
• Tongue: English
• Weight: 394 KB
• Volume: 22
• Category: Article
• ISSN: 0893-9659
• DOI: 10.1016/j.aml.2008.06.012

✦ Synopsis

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.