Research ArticleOpen AccessGoogle Scholar indexed
A Sufficient Condition for 2-Distance-Dominating Cycles
School of Mathematics and Statistics, Shandong Normal University, Jinan, China
School of Mathematics and Statistics, Shandong Normal University, Jinan, China
- 1 School of Mathematics and Statistics, Shandong Normal University, Jinan, China
- 2 School of Mathematics and Statistics, Shandong Normal University, Jinan, China
Copy link · social · email
Abstract
A cycle C of a graph G is a m -distance-dominating cycle if for all vertices of . Defin ing 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.
KeywordsDegree SumsDistance Dominating CyclesInsertible Vertex
- Bondy, J.A. and Fan, G. (1987) A Sufficient Condition for Dominating Cycles. Discrete Mathematics, 67, 205-208. https://doi.org/10.1016/0012-365X(87)90029-X
- Broersma, H.J. (1988) Existence of -Cycles and -Paths. Journal of Graph Theory, 12, 499-507. https://doi.org/10.1002/jgt.3190120405
- Fraisse, P. (1988) A Note on Distance-Dominating Cycles. Discrete Math, 71, 89-92. https://doi.org/10.1016/0012-365X(88)90033-7
- 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
- Bondy, J.A. (1980) Longest Paths and Cycles in Graphs of High Degree. Research Report CORR 80-16, University of Waterloo, Ontario.
- Wu, Y., Chen, Y. and Edein Cheng, T.C. (2021) Degree Sums and Dominating Cycles. Discrete Mathematics, 344, Article ID: 112224. https://doi.org/10.1016/j.disc.2020.112224
- Bondy, J.A. and Murty, U.S.R. (2008) Graph Theory. Springer, Berlin. https://doi.org/10.1007/978-1-84628-970-5