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

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 excess and for subcubic graphs; in the former case the size of excess we permit is qualitatively the best possible. We show...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2024-08
Hauptverfasser:	Akbari, Saieed, Sina Ghasemi Nezhad, Ghazizadeh, Reyhane, Haslegrave, John, Tohidi, Elahe
Format:	Artikel
Sprache:	eng
Schlagworte:	Graphs Lower bounds Matching
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!