Maximal value of the zeroth-order Randić index
Discrete Applied Mathematics
Connected (n,m)-graphs with minimum and maximum zeroth-order general Randić index
Discrete Applied Mathematics
Graph Theory
More on "Connected (n, m)-graphs with minimum and maximum zeroth-order general Randić index"
Discrete Applied Mathematics
Hi-index | 0.04 |
Let G be a simple connected graph and @a be a given real number. The zeroth-order general Randic index of ^0R"@a(G) is defined as @?"v"@?"V"("G")[d"G(v)]^@a, where d"G(v) denotes the degree of the vertex v of G. In this paper, for any @a(0,1), we give sharp bounds of the zeroth-order general Randic index ^0R"@a of all bicyclic graphs with n vertices and k pendent vertices.