The length of dominating cycle of claw-free graph
The length of dominating cycles is usually discussed in control problems. A dominating cycle of a graph G is a cycle C of G such that V ( G ) − V ( C ) is an independent set. In this article, we prove that for any claw-free graph G with δ ( G ) ≥ 2 , the length of longest dominating cycle is at leas...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SAGE Publishing
2017-11-01
|
| Series: | Advances in Mechanical Engineering |
| Online Access: | https://doi.org/10.1177/1687814017737726 |