首页 | 本学科首页   官方微博 | 高级检索  
     

Bounds on the Aα-Spectral Radius of a C3-Free Graph
作者姓名:Dongxia ZHU  Shuguang GUO  Rong ZHANG
作者单位:School of Mathematics and Statistics;School of Mathematics and Statistics
基金项目:Supported by the National Natural Science Foundation of China(Grant Nos.12071411,12171222)。
摘    要:Let G be a simple undirected graph.For any real numberα∈[0,1],Nikiforov defined the Aα-matrix of G as Aα(G)=αD(G)+(1-α)A(G)in 2017,where A(G)and D(G)are the adjacency matrix and the degree diagonal matrix of G,respectively.In this paper,we obtain a lower bound on the Aα-spectral radius of a C3-free graph forα∈[0,1)and a sharp upper bound on the Aα-spectral radius of a C3-free k-cycle graph forα∈[1/2,1).

关 键 词:C3-free  graph  k-cycle  graph  Aα-spectral  radius  BOUND
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号