The spectral determination conjecture for Kite graphs

For integers $p$ and $q$ with $q>2$, let $Kite_{p,q}$ denote the graph obtained by appending a complete graph $K_p$ to a pendant vertex of a path $P_q$. A graph is determined by adjacency spectrum (DAS) if every graph cospectral with it is isomorphic to it. Kite-graph spectral determination conjecture. The graphs $Kite_{p,q}$ are DAS.