Funder
South African National Research Foundation
University of Johannesburg
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference26 articles.
1. Zero forcing sets and the minimum rank of graphs;AIM Special Work Group;Linear Algebra Appl.,2008
2. Upper bounds on the k-forcing number of a graph;Amos;Discrete Appl. Math.,2015
3. Parameters related to tree-width, zero forcing, and maximum nullity of a graph;Barioli;J. Graph Theory,2013
4. B. Brimkov, R. Davila, Characterizations of the connected forcing number of a graph, manuscript, 2016, arXiv preprint arXiv:1604.00740.
5. Complexity and computation of connected zero forcing;Brimkov;Discrete Appl. Math.,2017
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献