Article ID Journal Published Year Pages File Type
1709675 Applied Mathematics Letters 2009 4 Pages PDF
Abstract

A tree is called double starlike   if it has exactly two vertices of degree greater than 2. We denote by Hn(p,p)Hn(p,p) (n≥2,p≥1n≥2,p≥1) one special double starlike graph. In this work, graph Hn(p,p)Hn(p,p) will be proved to be determined by its Laplacian spectrum.

Keywords
Related Topics
Physical Sciences and Engineering Engineering Computational Mechanics
Preview
One special double starlike graph is determined by its Laplacian spectrum
Authors
, , ,