AKCE International Journal of Graphs and Combinatorics (Aug 2019)
Zeroth-order general Randić index of cactus graphs
Abstract
A connected graph is said to be cactus if no two cycles of have any common edge. The present note is devoted to developing some extremal results for the zeroth-order general Randić index of cactus graphs and finding some sharp bounds on this index.
Keywords