Wang, Xinman and Li, Linyu (2022) A Sufficient Condition for 2-Distance-Dominating Cycles. Engineering, 14 (03). pp. 113-118. ISSN 1947-3931
![[thumbnail of eng_2022032116092820.pdf]](http://archive.bionaturalists.in/style/images/fileicons/text.png)
Text
eng_2022032116092820.pdf - Published Version
Download (280kB)
Official URL: https://doi.org/10.4236/eng.2022.143010
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.
| Item Type: | Article |
|---|---|
| Subjects: | Pustaka Library > Engineering |
| Depositing User: | Unnamed user with email support@pustakalibrary.com |
| Date Deposited: | 07 Jun 2023 07:15 |
| Last Modified: | 17 Jan 2024 04:53 |
| URI: | http://archive.bionaturalists.in/id/eprint/1042 |
Actions (login required)
- View Item