运筹学学报(中英文) ›› 2024, Vol. 28 ›› Issue (2): 143-150.doi: 10.15960/j.cnki.issn.1007-6093.2024.02.011

•   • 上一篇    下一篇

给定独立数的树的倒数度距离

邢抱花1, 孙旻昊1, 余桂东1,2,*()   

  1. 1. 安庆师范大学数理学院, 安徽安庆 246133
    2. 合肥幼儿师范高等专科学校公共教学部, 安徽合肥 230013
  • 收稿日期:2022-11-22 出版日期:2024-06-15 发布日期:2024-06-07
  • 通讯作者: 余桂东 E-mail:guidongy@163.com
  • 基金资助:
    安徽省高校自然科学研究重点项目(KJ2021A0650);安徽省高校自然科学研究重点项目(KJ2020A0894);国家自然科学基金(11871077);安徽省研究生线下示范课程图论(2022xxsfkc038)

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

摘要:

$G$是一个简单的无向连通图, $T_{n, \alpha}$是顶点数为$n$独立数为$\alpha$的所有树的集合。本文主要讨论了在集合$T_{n, \alpha}$中的最大倒数度距离, 并刻画了唯一对应的极图。

关键词: 倒数度距离, 独立数,

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

中图分类号: