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 |
| id |
doaj-c8a9e9caa7484cbaab13910c263530bc |
|---|---|
| record_format |
Article |
| spelling |
doaj-c8a9e9caa7484cbaab13910c263530bc2020-11-25T02:29:54ZengGeorgia Southern UniversityTheory and Applications of Graphs2470-98592015-01-012210.20429/tag.2015.020202Dynamic approach to k-forcingYair CaroRyan PepperThe 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 Pepper [2], while also answering an open problem posed by Meyer [9].https://digitalcommons.georgiasouthern.edu/tag/vol2/iss2/2zero-forcing numberk-forcing numbernullity |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Yair Caro Ryan Pepper |
| spellingShingle |
Yair Caro Ryan Pepper Dynamic approach to k-forcing Theory and Applications of Graphs zero-forcing number k-forcing number nullity |
| author_facet |
Yair Caro Ryan Pepper |
| author_sort |
Yair Caro |
| title |
Dynamic approach to k-forcing |
| title_short |
Dynamic approach to k-forcing |
| title_full |
Dynamic approach to k-forcing |
| title_fullStr |
Dynamic approach to k-forcing |
| title_full_unstemmed |
Dynamic approach to k-forcing |
| title_sort |
dynamic approach to k-forcing |
| publisher |
Georgia Southern University |
| series |
Theory and Applications of Graphs |
| issn |
2470-9859 |
| publishDate |
2015-01-01 |
| description |
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 Pepper [2], while also answering an open problem posed by Meyer [9]. |
| topic |
zero-forcing number k-forcing number nullity |
| url |
https://digitalcommons.georgiasouthern.edu/tag/vol2/iss2/2 |
| work_keys_str_mv |
AT yaircaro dynamicapproachtokforcing AT ryanpepper dynamicapproachtokforcing |
| _version_ |
1724831024987242496 |