On the spectral characterization of kite graphs

Journal of Algebra Combinatorics Discrete Structures and Applications

article

Sezer Sorgun¹  Hatice Topcu¹ 

[1] Department of Mathematics, Nevşehir Hacı Bektaş VeliUniversity

关键词: Kite graph;    Cospectral graphs;    Clique number;    Determined by adjacency spectrum;   

DOI  :  10.13069/jacodesmath.01767

学科分类：社会科学、人文和艺术（综合）

来源: Yildiz Technical University

【 摘 要 】

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

【 授权许可】

CC BY