首页|General Randic index of unicyclic graphs with given diameter
General Randic index of unicyclic graphs with given diameter
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
We study the general Randic index R-a(G) = Sigma(uv is an element of E)((G) )[deg(G)(u)deg(G)(v)](a), where a is an element of R, E(G) is the edge set of a graph G, and deg(G)(u) and deg(G)(v) are the degrees of vertices u and v, respectively. For a set of unicyclic graphs of given order and diameter, we present the unique graph having the minimum general Randic index, where -0.64 <= a < 0. Since R-1/2(G) is the Randi6 index of a graph G, our result holds also for the classical Randic index. (C) 2021 Elsevier B.V. All rights reserved.
NSTL
Elsevier
