One special double starlike graph is determined by its Laplacian spectrum

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.