On the spectral characterization of kite graphs

From MaRDI portal
Publication:5241115

zbMATH Open1425.05095arXiv1506.01632MaRDI QIDQ5241115FDOQ5241115

Sezer Sorgun, Hatice Topcu

Publication date: 30 October 2019

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


Full work available at URL: https://arxiv.org/abs/1506.01632




Recommendations




Cites Work


Cited In (8)





This page was built for publication: On the spectral characterization of kite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5241115)