Journal
MATHEMATICS
Volume 10, Issue 20, Pages -Publisher
MDPI
DOI: 10.3390/math10203729
Keywords
Randic index; total domination number; tree
Categories
Ask authors/readers for more resources
This paper studies the lower bound of the Randic index of trees in terms of the order and the total domination number, and characterizes the trees with the minimal Randic index.
The Randic index is among the most famous degree-based topological indices in chemical graph theory. It was introduced due to its application in modeling the properties of certain molecular structures and has been extensively studied. In this paper, we study the lower bound of the Randic index of trees in terms of the order and the total domination number. Finally, trees with the minimal Randic index are characterized.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available