Lower bounds for the Randi\'c index in terms of matching number

We investigate how small the Randi\'c 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 excess and for subcubic graphs; in the former case the size of excess we permit is qualitatively the best possible. W...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Akbari, Saieed, Nezhad, Sina Ghasemi, Ghazizadeh, Reyhane, Haslegrave, John, Tohidi, Elahe
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!