Kite graphs determined by their spectra

摘要

A kite graph Kin, ω is a graph obtained from a clique Kω and a path Pn−ω by adding an edge between a vertex from the clique and an endpoint from the path. In this note, we prove that Kin,n−1 is determined by its signless Laplacian spectrum when n ≠ 5 and n ≥ 4, and Kin,n−1 is also determined by its distance spectrum when n ≥ 4.