Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Reference18 articles.
1. AIM Special Work Group: Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl. 428(7), 1628–1648 (2008)
2. Brimkov, B., Mikesell, D., Smith. L.: Connected power domination in graphs. J. Combinatorial Optimization 38, 292–315 (2019)
3. Brimkov, B., Davila, R.: Characterizations of the connected forcing number of a graph. arXiv preprint arXiv:1604.00740, (2016)
4. Brimkov, B., Hicks, I.V.: Complexity and computation of connected zero forcing. Discrete Appl. Math. 229, 31–45 (2017)
5. Burgarth, D., Giovannetti, V.: Full control by locally induced relaxation. Phys. Rev. Lett. 99(10), 100501 (2007)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS;Bulletin of the Australian Mathematical Society;2023-06-19
2. Semitotal forcing in claw-free cubic graphs;Discussiones Mathematicae Graph Theory;2023