Article citationsMore>>

Fang, Y. and Xiong, L. (2021) Circumference of a Graph and Its Distance Dominating Longest Cycles. Discrete Mathematics, 344, Article ID: 112196.
https://doi.org/10.1016/j.disc.2020.112196

has been cited by the following article:

• 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.