Complete solution to a conjecture on Randic index

For a graph G, the Randic index R(G) of G is defined by , where d(u) is the degree of a vertex u and the summation runs over all edges uv of G. Let G(k,n) be the set of connected simple graphs of order n with minimum degree k. Bollobás and Erdos once asked for finding the minimum value of the Randic index among the graphs in G(k,n). There have been many partial solutions for this question. In this paper we give a complete solution to the question.

MoreLess

Year of publication:	2010
Authors:	Li, Xueliang ; Liu, Bolian ; Liu, Jianxi
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 200.2010, 1, p. 9-13
Publisher:	Elsevier
Keywords:	Simple graph Minimum degree Randic index Minimum value

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005023355