Let G=(V, E) be an undirected simple graph of order n with m edges without isolated vertices. Further, let d_1\ge d_2\ge \cdots \ge d_n be vertex degree sequence of G. General Randi\’ c index of graph G=(V,E) is defined by \displaystyle R_{\alpha}=\sum_{(i,j)\in E}(d_id_j)^{\alpha}, where \alpha \in \mathbb{R} -\{0\}. We consider the case when \alpha =-1 and obtain upper bound for R_{-1}.

Additional Information

Author(s)

Bekakos, M. P., Bekakos, P. M., Milanoviç, E. I., Milanoviç, I. Ž.