Graphs of extremal weights
Our main aim is to show that the Randić weight of a connected graph of order n is at least √n - 1. As shown by the stars, this bound is best possible.
Bollobás, B., & Erdös, P. (1998). Graphs of extremal weights. Ars Combinatoria, 50, 225-233. Retrieved from https://digitalcommons.memphis.edu/facpubs/4851