On the spectral characterization of Kite graphs
Abstract
The 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)≥ p-2q+1. Also, we prove that Kitep,2 graphs are determined by their adjacency spectrum.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.