TITLE:
A Sufficient Condition for 2-Distance-Dominating Cycles
AUTHORS:
Xinman Wang, Linyu Li
KEYWORDS:
Degree Sums, Distance Dominating Cycles, Insertible Vertex
JOURNAL NAME:
Engineering,
Vol.14 No.3,
March
22,
2022
ABSTRACT: A cycle C of a graph G is a m-distance-dominating
cycle if for all vertices of . Defining
denotes the
minimum value of the degree sum of any k independent vertices of G. In this
paper, we prove that if G is a
3-connected graph on n vertices, and
if , then every longest cycle is m-distance-dominating cycles.