@article{article_285346, title={On the spectral characterization of kite graphs}, journal={Journal of Algebra Combinatorics Discrete Structures and Applications}, volume={3}, pages={81–90}, year={2016}, DOI={10.13069/jacodesmath.01767}, author={Sorgun, Sezer and Topcu, Hatice}, keywords={Kite graph,Cospectral graphs,Clique number,Determined by adjacency spectrum}, abstract={The Kite graph, denoted by $Kite_{p,q}$ is obtained by appending a complete graph $K_{p}$ to a pendant vertex of a path $P_{q}$. In this paper, firstly we show that no two non-isomorphic kite graphs are cospectral w.r.t the adjacency matrix. Let $G$ be a graph which is cospectral with $Kite_{p,q}$ and let $w(G)$ be the clique number of $G$. Then, it is shown that $w(G)\geq p-2q+1$. Also, we prove that $Kite_{p,2}$ graphs are determined by their adjacency spectrum.}, number={2}, publisher={iPeak Academy}