Sharp Lower Bound for Randić index of Trees with Fixed Roman Domination Number
Let be a simple connected graph with vertex set and edge set . The Randić index of graph is the value , where and refer to the degree of the vertices and . We obtain a lower bound for the Randić index of trees in terms of the order and the Roman domination number, and we characterize the extremal trees for this bound.
Authors
- Fateme Movahedi (ORCID: https://orcid.org/0000-0001-7863-7915)
- Mohammad Hadi Akhbari (ORCID: https://orcid.org/0000-0002-2669-4966)
- Roslan Hasni (ORCID: https://orcid.org/0000-0003-3695-2145)
Institutions
- Universiti Malaysia Terengganu (MY)
- Golestan University (IR)
- Islamic Azad University, Estahban Branch (IR)
Publication Details
- Journal
- Ars Combinatoria
- Published
- 2024-12-31
- DOI
- https://doi.org/10.61091/ars161-14
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00