The (d2)-leaky forcing number of Qd and -leaky forcing number of GP(n,1)

Discrete Optimization - Tập 46 - Trang 100744 - 2022
Rebekah Herrman1
1Department of Industrial and Systems Engineering, The University of Tennessee, Knoxville, TN, United States of America

Tài liệu tham khảo

A.M.R.S.G.W. Group, 2008, Zero forcing sets and the minimum rank of graphs, Linear Algebra Appl., 428, 1628, 10.1016/j.laa.2007.10.009 Barioli, 2010, Zero forcing parameters and minimum rank problems, Linear Algebra Appl., 433, 401, 10.1016/j.laa.2010.03.008 Huang, 2010, On minimum rank and zero forcing sets of a graph, Linear Algebra Appl., 432, 2961, 10.1016/j.laa.2010.01.001 Bozeman, 2019, Restricted power domination and zero forcing problems, J. Comb. Optim., 37, 935, 10.1007/s10878-018-0330-6 Lin, 2019, Zero forcing number, grundy domination number, and their variants, Linear Algebra Appl., 563, 240, 10.1016/j.laa.2018.11.003 Benson, 2018, Zero forcing and power domination for graph products, Australas. J. Combin., 70, 221 Hua, 2021 Fallat, 2016, On the complexity of the positive semidefinite zero forcing number, Linear Algebra Appl., 491, 101, 10.1016/j.laa.2015.03.011 Burgarth, 2007, Full control by locally induced relaxation, Phys. Rev. Lett., 99, 10.1103/PhysRevLett.99.100501 Dillman, 2019 Alameda, 2022, On leaky forcing and resilience, Discrete Appl. Math., 306, 32, 10.1016/j.dam.2021.09.005 Alameda, 2020 Geneson, 2020