On the spectral characterization of Kite graphs
Combinatorics
2015-06-05 v1
Abstract
The \textit{Kite graph}, denoted by is obtained by appending a complete graph to a pendant vertex of a path . In this paper, firstly we show that no two non-isomorphic kite graphs are cospectral w.r.t adjacency matrix. Let be a graph which is cospectral with and the clique number of is denoted by . Then, it is shown that . Also, we prove that 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}
}