Lower bounds for the Randić index in terms of matching number

Saieed Akbari, Sina Ghasemi Nezhad, Reyhane Ghazizadeh +2

We investigate how small the Randić index of a graph can be in terms of its matching number, and prove several results. We give best-possible linear bounds for graphs of small exce…