Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Ghazizadeh, Reyhane"'
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
Externí odkaz:
http://arxiv.org/abs/2402.12884
