Engineering
Volume 14, Issue 3 (March 2022)
ISSN Print: 1947-3931 ISSN Online: 1947-394X
Google-based Impact Factor: 0.66 Citations
A Sufficient Condition for 2-Distance-Dominating Cycles ()
Affiliation(s)
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.
KEYWORDS
Share and Cite:
Cited by
Copyright © 2024 by authors and Scientific Research Publishing Inc.
This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.
