kite p+2,p is determined by its laplacian spectrum

Kite n,p denotes the kite graph that is obtained by appending complete graph with order p ≥ 4 to an endpoint of path graph with order n − p. it is shown that kite n,p is determined by its adjacency spectrum for all p and n [h. topcu and s. sorgun, the kite graph is determined by its adjacency spectrum, applied math. and comp., 330 (2018) 134–142]. for n − p = 1, it is proven that kite n,p is determined by its signless laplacian spectrum when n ≥ 4, n ̸= 5 and is also determined by its distance spectrum when n ≥ 4 [k. c. das and m. liu, kite graphs are determined by their spectra, applied math. and comp., 297 (2017) 74–78]. in this note, we say that kite n,p is determined by its laplacian spectrum for n − p ≤ 2.