高级检索

 作者：Lusheng Wang , Boting Yang 来源：[J].Theoretical Computer Science(IF 0.489), 2019, Vol.786, pp.44-54Elsevier 摘要：Abstract(#br)The positive semidefinite zero forcing number is a variant of the zero forcing number, which is an important parameter in the study of minimum rank/maximum nullity problems. In this paper, we consider two classes of graphs: matching-chain graphs and claw-free graphs....
 作者：Kirk Boyer , Boris Brimkov , Sean English ... 来源：[J].Discrete Applied Mathematics(IF 0.718), 2019, Vol.258, pp.35-48Elsevier 摘要：Abstract(#br)Zero forcing is an iterative graph coloring process, where given a set of initially colored vertices, a colored vertex with a single uncolored neighbor causes that neighbor to become colored. A zero forcing set is a set of initially colored vertices which causes the...
 作者：Boris Brimkov , Caleb C. Fast , Illya V. Hicks 来源：[J].European Journal of Operational Research(IF 2.038), 2018Elsevier 摘要：Abstract(#br)In this paper, we propose computational approaches for the zero forcing problem, the connected zero forcing problem, and the problem of forcing a graph within a specified number of timesteps. Our approaches are based on a combination of integer programming models and...
 作者：Leslie Hogben 来源：[J].Discrete Applied Mathematics(IF 0.718), 2019Elsevier 摘要：Abstract(#br)The concept of zero forcing is extended from graphs to uniform hypergraphs in analogy with the way zero forcing was defined as an upper bound for the maximum nullity of the family of symmetric matrices whose nonzero pattern of entries is described by a given graph: A...
 作者：Shuchao Li , Wanting Sun 来源：[J].Journal of Combinatorial Optimization(IF 0.592), 2020, Vol.39 (48), pp.365-384Springer 摘要：...166667em"/> Φ ( G ) , e x ( G ) \documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$Z(G),\, p(G),\, \Phi (G), ex(G)$$\end{document} and M ( G ), respectively, be the zero forcing...
 作者：Franklin H.J. Kenter , Jephian C.-H. Lin 来源：[J].Linear Algebra and Its Applications(IF 0.968), 2019, Vol.576, pp.124-141Elsevier 摘要：Abstract(#br)Zero forcing is an iterative process on a graph used to bound the maximum nullity. The process begins with select vertices as colored, and the remaining vertices can become colored under a specific color change rule. The goal is to find a minimum set of vertices such...
 作者：Shaun Fallat , Karen Meagher , Abolghasem Soltani ... 来源：[J].Theoretical Computer Science(IF 0.489), 2018, Vol.734, pp.119-130Elsevier 摘要：Abstract(#br)Zero forcing parameters, associated with graphs, have been studied for over a decade, and have gained popularity as the number of related applications grows. In particular, it is well-known that such parameters are related to certain vertex coverings. Continuing alon...
 作者：Randy Davila , Thomas Kalinowski , Sudeep Stephen 来源：[J].Discrete Applied Mathematics(IF 0.718), 2018, Vol.250, pp.363-367Elsevier 摘要：... Then, at each time step, a black vertex with exactly one white neighbor forces its white neighbor to become black. The initial set of black vertices is called a zero forcing set if by iterating this process, all of the vertices in G become black. The zero forcing number of...
 作者：Joshua Carlson , Leslie Hogben , Jürgen Kritschgau ... 来源：[J].Discrete Applied Mathematics(IF 0.718), 2018, Vol.254Elsevier 摘要：Abstract(#br)Zero forcing is a process on a graph that colors vertices blue by starting with some of the vertices blue and applying a color change rule. Throttling minimizes the sum of the size of the initial blue vertex set and the number of the time steps needed to color the gr...
 作者：Shaun Fallat , Karen Meagher , Boting Yang 来源：[J].Linear Algebra and Its Applications(IF 0.968), 2016, Vol.491, pp.101-122Elsevier 摘要：Abstract(#br)The positive semidefinite zero forcing number of a graph is a graph parameter that arises from a non-traditional type of graph colouring and is related to a more conventional version of zero forcing. We establish a relation between the zero forcing and the fast–m...