## Abstract

A dynamic coloring of the vertices of a graph G starts with an initial subset S of colored vertices, with all remaining vertices being non-colored. At each discrete time interval, a colored vertex with exactly one non-colored neighbor forces this non-colored neighbor to be colored. The initial set S is called a forcing set (zero forcing set) of G if, by iteratively applying the forcing process, every vertex in G becomes colored. If the initial set S has the added property that it induces a subgraph of G without isolated vertices, then S is called a total forcing set in G. The total forcing number of G, denoted F_{t}(G) , is the minimum cardinality of a total forcing set in G. We prove that if G is a connected, claw-free, cubic graph of order n≥ 6 , then Ft(G)≤12n, where a claw-free graph is a graph that does not contain K_{1 , 3} as an induced subgraph. The graphs achieving equality in these bounds are characterized.

Original language | English |
---|---|

Pages (from-to) | 1371-1384 |

Number of pages | 14 |

Journal | Graphs and Combinatorics |

Volume | 34 |

Issue number | 6 |

DOIs | |

Publication status | Published - 1 Nov 2018 |

## Keywords

- Claw-free
- Cubic
- Cycle cover
- Total forcing sets
- Zero forcing sets

## ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics