k-叶子连通图的度基指标充分条件
Degree-Based Indices Sufficient Conditions for k-Leaf-Connected Graphs
吴红艳 1敖国艳2
作者信息
- 1. 呼伦贝尔学院数理学院,内蒙古 海拉尔 021008
- 2. 呼伦贝尔学院数理学院,内蒙古 海拉尔 021008;呼伦贝尔学院信息与计算科学研究中心,内蒙古 海拉尔 021008
- 折叠
摘要
判断给定图是否为k-叶子连通的问题是NP-完全的.因此,研究k-叶子连通图的充分条件具有深刻的理论意义.利用Gurgel等人的度序列条件,给出了一个连通图是k-叶子连通的基于度基指标的充分条件,推广了哈密顿连通图上相应的结果.
Abstract
The problem of determining whether a given graph is k-leaf-connected is NP-complete.Therefore,the study of sufficient conditions for k-leaf-connected graphs has far-reaching theoretical significance.In this paper,using the degree sequence condition of Gurgel et al.,we present sufficient conditions in terms of degree-based indices for a connected graph to be k-leaf-connected,which extend the corresponding results on Hamilton-connected graphs.
关键词
哈密顿连通/k-叶子连通/度基指标Key words
Hamilton-connected/k-leaf-connected/degree-based index引用本文复制引用
出版年
2024
NETL
NSTL
万方数据