English

On the spectral characterization of Kite graphs

Combinatorics 2015-06-05 v1

Abstract

The \textit{Kite graph}, denoted by Kitep,qKite_{p,q} is obtained by appending a complete graph KpK_{p} to a pendant vertex of a path PqP_{q}. In this paper, firstly we show that no two non-isomorphic kite graphs are cospectral w.r.t adjacency matrix. Let GG be a graph which is cospectral with Kitep,qKite_{p,q} and the clique number of GG is denoted by w(G)w(G). Then, it is shown that w(G)p2q+1w(G)\geq p-2q+1. Also, we prove that Kitep,2Kite_{p,2} graphs are determined by their adjacency spectrum.

Keywords

Cite

@article{arxiv.1506.01632,
  title  = {On the spectral characterization of Kite graphs},
  author = {Sezer Sorgun and Hatice Topcu},
  journal= {arXiv preprint arXiv:1506.01632},
  year   = {2015}
}