Operations Research Transactions ›› 2024, Vol. 28 ›› Issue (2): 143-150.doi: 10.15960/j.cnki.issn.1007-6093.2024.02.011

Previous Articles     Next Articles

The reciprocal degree distance of trees with given independence number

Baohua XING1, Minhao SUN1, Guidong YU1,2,*()   

  1. 1. School of Mathematics and Physics, Anqing Normal University, Anqing 246133, Anhui, China
    2. Department of Public Teaching, Hefei Preschool Education College, Hefei 230013, Anhui, China
  • Received:2022-11-22 Online:2024-06-15 Published:2024-06-07
  • Contact: Guidong YU E-mail:guidongy@163.com

Abstract:

Let $G$ be a simple undirected connected graph, $T_{n, \alpha}$ be the set of trees with independence number $\alpha$ and order $n$. In this paper, we discuss the maximum reciprocal degree distance of trees in $T_{n, \alpha}$ and characterize the unique corresponding extremal graph.

Key words: reciprocal degree distance, independence number, tree

CLC Number: