Graphs of extremal weights

Authors

Béla Bollobás, Faculty of MathematicsFollow
Paul Erdös, Alfréd Rényi Institute of Mathematics

Abstract

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.

Publication Title

Ars Combinatoria

Recommended Citation

Bollobás, B., & Erdös, P. (1998). Graphs of extremal weights. Ars Combinatoria, 50, 225-233. Retrieved from https://digitalcommons.memphis.edu/facpubs/4851