MMN-462
On the modified Randić index of trees, unicyclic graphs and bicyclic graphs
Abstract
The modified Randic index of a graph G is a graph invariant
closely related to the classical Randic index, defined as
R0(G) =
X
uv2E(G)
1
maxfdG(u); dG(v)g
;
where E(G) is the edge set of G, dG(u) is the degree of vertex u in G.
We obtain best possible lower bounds for the modified Randic index of
trees, unicyclic graphs and bicyclic graphs respectively when the number
of vertices and matching number are fixed.
Vol. 13 (2012), No. 2, pp. 415-427