Author:
Davila Randy,Henning Michael A.
Publisher
Springer Science and Business Media LLC
Reference43 articles.
1. AIM Special Work Group: Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl. 428(7), 1628–1648 (2008)
2. Aazami, A.: Hardness results and approximation algorithms for some problems on graphs. Ph.D. thesis, University of Waterloo. https://uwspace.uwaterloo.ca/handle/10012/4147 (2008)
3. Amos, D., Caro, Y., Davila, R., Pepper, R.: Upper bounds on the $$k$$ k -forcing number of a graph. Discrete Appl. Math. 181, 1–10 (2015)
4. Barioli, F., Barrett, W., Fallat, S.M., Hall, T., Hogben, L., Shader, B., van den Driessche, P., van der Holst, H.: Parameters related to tree-width, zero forcing, and maximum nullity of a graph. J. Graph Theory 72(2), 146–177 (2013)
5. Brešar, B., Bujtás, Cs, Gologranc, T., Klavžar, S., Košmrlj, G., Patkós, B., Tuza, Zs, Vizer, M.: Grundy dominating sequences and zero forcing sets. Discrete Optim. 26, 66–77 (2017)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献