>
Fa   |   Ar   |   En
   On the spectral characterization of kite graphs  
   
نویسنده Sorgun Sezer ,Topcu Hatice
منبع journal of algebra combinatorics discrete structures and applications - 2016 - دوره : 3 - شماره : 2 - صفحه:81 -90
چکیده    The 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 the adjacency matrix. let g be a graph which is cospectral with kite_p,q and let w (g) be the clique number of g. then, it is shown that w(g) ≥ p - 2q + 1. also, we prove that kite_p,2 graphs are determined by their adjacency spectrum.
کلیدواژه Kite graph ,Cospectral graphs ,Clique number ,Determined by adjacency spectrum
آدرس Nevsehir Hacı Bektas Veli University, Department of Mathematics, Turkey, Nevsehir Hacı Bektas Veli University, Department of Mathematics, Turkey
پست الکترونیکی haticekamittopcu@gmail.com
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved