Funder
Javna Agencija za Raziskovalno Dejavnost RS
Publisher
Springer Science and Business Media LLC
Reference23 articles.
1. AIM Minimum Rank-Special Graphs Work Group: Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl. 428, 1628–1648 (2008)
2. Amos, D., Caro, Y., Davila, R., Pepper, R.: Upper bounds on the $$k$$-forcing number of a graph. Discrete Appl. Math. 181, 1–10 (2015)
3. Barioli, F., Barrett, W., Fallat, S.M., Hall, H.T., Hogben, L., Shader, B., van den Driessche, P., van der Holst, H.: Zero forcing parameters and minimum rank problems. Linear Algebra Appl. 433, 401–411 (2010)
4. Barioli, F., Barrett, W., Fallat, S.M., Hall, H.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, 146–177 (2013)
5. Benson, K.F., Ferrero, D., Flagg, M., Furst, V., Hogben, L., Vasilevskak, V., Wissman, B.: Zero forcing and power domination for graph products. Australas. J. Combin. 70, 221–235 (2018)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Differentiating Odd Dominating Sets in Graphs;European Journal of Pure and Applied Mathematics;2024-07-31
2. Convex 2-Domination in Graphs;European Journal of Pure and Applied Mathematics;2024-07-31