Dynamic approach to k-forcing
| Autor: | Yair Caro, Ryan Pepper |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2015 |
| Předmět: | |
| Zdroj: | Theory and Applications of Graphs, Vol 2, Iss 2 (2015) |
| Druh dokumentu: | article |
| ISSN: | 2470-9859 |
| DOI: | 10.20429/tag.2015.020202 |
| Popis: | 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]. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|