Open AccessSignless Laplacian determination of a family of double starlike trees
Author(s) -
Reza Sharafdini,
Ali Zeydi Abdian,
Afshin Behmaram
Publication year - 2021
Publication title -
ukraïnsʹkij matematičnij žurnal
Language(s) - English
Resource type - Journals
ISSN - 1027-3190
DOI - 10.37863/umzh.v73i9.634
Subject(s) - combinatorics , vertex (graph theory) , mathematics , graph , tree (set theory)
UDC 517.9Two graphs are said to be -cospectral if they have the same signless Laplacian spectrum.A graph is said to be DQS if there are no other nonisomorphic graphs -cospectral with it. A tree is called double starlike if it has exactly two vertices of degree greater than 2.Let with 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 DQS for