摘要
The general Randic index of a graph G is a graph invariant defined as R(alpha) = R(alpha)(G) = Sigma(uv is an element of E(G)) (d(u)d(v))(alpha), where d(u) denotes the degree of vertex a in G, E(G) denotes the edge set of G, and alpha is a real number. In this note, we report some bounds for R(alpha), especially when vertical bar alpha vertical bar >= 1.
- 出版日期2009
- 单位华南师范大学