Laplacian spectral characterization of some double starlike trees
Combinatorics
2017-02-08 v2
Abstract
A tree is called double starlike if it has exactly two vertices of degree greater than two. Let denote the double starlike tree obtained by attaching pendant vertices to one pendant vertex of the path and pendant vertices to the other pendant vertex of . In this paper, we prove that is determined by its Laplacian spectrum.
Keywords
Cite
@article{arxiv.1205.6027,
title = {Laplacian spectral characterization of some double starlike trees},
author = {Pengli Lu and Xiaogang Liu},
journal= {arXiv preprint arXiv:1205.6027},
year = {2017}
}