Funder
National Natural Science Foundation of China
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference20 articles.
1. Hardness Results and Approximation Algorithms for Some Problems on Graphs;Aazami,2008
2. Upper bounds on the k-forcing number of a graph;Amos;Discrete Appl. Math.,2015
3. Zero forcing sets and the minimum rank of graphs;Barioli;Linear Algebra Appl.,2008
4. Parameters related to tree-width, zero forcing, and maximum nullity of a graph;Barioli;J. Graph Theory,2013
5. Full control by locally induced relaxation;Burgarth;Phys. Rev. Lett.,2007
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bounds on Zero Forcing Using (Upper) Total Domination and Minimum Degree;Bulletin of the Malaysian Mathematical Sciences Society;2024-07-15
2. UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS;Bulletin of the Australian Mathematical Society;2023-06-19
3. Semitotal forcing in claw-free cubic graphs;Discussiones Mathematicae Graph Theory;2023