arXiv:2103.15288 [math.CO]AbstractReferencesReviewsResources
Sharp bounds on the zeroth-order general Randić index of trees in terms of domination number
Published 2021-03-29Version 1
The zeroth-order general Randi\'c index of graph $G=(V_G,E_G)$, denoted by $^0R_{\alpha}(G)$, is the sum of items $(d_{v})^{\alpha}$ over all vertices $v\in V_G$, where $\alpha$ is a pertinently chosen real number. In this paper, we obtain the sharp upper and lower bounds on $^0R_{\alpha}$ of trees with a domination number $\gamma$, in intervals $\alpha\in(-\infty,0)\cup(1,\infty)$ and $\alpha\in(0,1)$, respectively. The corresponding extremal graphs of these bounds are also characterized.
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2203.16901 [math.CO] (Published 2022-03-31)
Improved Lower Bounds on the Domination Number of Hypercubes and Binary Codes with Covering Radius One
arXiv:1410.4334 [math.CO] (Published 2014-10-16)
Improved upper bounds on the domination number of graphs with minimum degree at least five
arXiv:1601.02234 [math.CO] (Published 2016-01-10)
Hypo-efficient domination and hypo-unique domination