Dynamic approach to k-forcing
The k-forcing number of a graph is a generalization of the zero forcing number. In this note, we give a greedy algorithm to approximate the k-forcing number of a graph. Using this dynamic approach, we give corollaries which improve upon two theorems from a recent paper of Amos, Caro, Davila and Pepp...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Georgia Southern University
2015-01-01
|
Series: | Theory and Applications of Graphs |
Subjects: | |
Online Access: | https://digitalcommons.georgiasouthern.edu/tag/vol2/iss2/2 |