pith. sign in

arxiv: 1506.01632 · v1 · pith:6OAZ7QT3new · submitted 2015-06-04 · 🧮 math.CO

On the spectral characterization of Kite graphs

classification 🧮 math.CO
keywords kitegraphgraphsadjacencycospectraldenotedappendingcharacterization
0
0 comments X
read the original abstract

The \textit{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 adjacency matrix. Let $G$ be a graph which is cospectral with $Kite_{p,q}$ and the clique number of $G$ is denoted by $w(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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.