Title of article
One special double starlike graph is determined by its Laplacian spectrum
Author/Authors
Liu، نويسنده , , Xiaogang and Zhang، نويسنده , , Yuanping and Lu، نويسنده , , Pengli، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
4
From page
435
To page
438
Abstract
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.
Keywords
Double star graph , Laplacian matrix , Laplacian spectrum , Cospectral graphs , Double starlike tree
Journal title
Applied Mathematics Letters
Serial Year
2009
Journal title
Applied Mathematics Letters
Record number
1525801
Link To Document