摘 要: | 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).
|