典型文献
Bounds on the Aα-Spectral Radius of a C3-Free Graph
文献摘要：
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).
文献关键词：
中图分类号：
作者姓名：
Dongxia ZHU;Shuguang GUO;Rong ZHANG
作者机构：
School of Mathematics and Statistics,Qinghai Normal University,Qinghai 810008,P.R.China;School of Mathematics and Statistics,Yancheng Teachers University,Jiangsu 224002,P.R.China
文献出处：
引用格式：
[1]Dongxia ZHU;Shuguang GUO;Rong ZHANG-.Bounds on the Aα-Spectral Radius of a C3-Free Graph)[J].数学研究及应用,2022(01):1-7
A类：
B类：
Bounds,Spectral,Radius,C3,Free,Graph,Let,simple,undirected,graph,For,any,real,number,Nikiforov,defined,matrix,as,where,are,adjacency,degree,diagonal,respectively,In,this,paper,obtain,lower,bound,spectral,radius,free,sharp,upper,cycle
AB值：
0.660237
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
