On the complexity of failed zero forcing

@article{Shitov2017OnTC,
  title={On the complexity of failed zero forcing},
  author={Yaroslav Shitov},
  journal={Theor. Comput. Sci.},
  year={2017},
  volume={660},
  pages={102-104}
}
  • Y. Shitov
  • Published 1 September 2016
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
Let $G$ be a simple graph whose vertices are partitioned into two subsets, called filled vertices and empty vertices. A vertex $v$ is said to be forced by a filled vertex $u$ if $v$ is a unique empty neighbor of $u$. If we can fill all the vertices of $G$ by repeatedly filling the forced ones, then we call an initial set of filled vertices a forcing set. We discuss the so-called failed forcing number of a graph, which is the largest cardinality of a set which is not forcing. Answering the… 
All Graphs with a Failed Zero Forcing Number of Two
TLDR
This paper investigates the largest size of a set S that does not force all of the vertices in a graph to be in S, known as the failed zero forcing number of a graph and will be denoted by F(G).
Blocking zero forcing processes in Cartesian products of graphs
TLDR
A tight upper bound is provided for the zero blocking number of Cartesian products of two arbitrary graphs when one of the graphs in the product is a cycle and the other is a path with at least as many vertices as the cycle.
On the zero blocking number of rectangular, cylindrical, and Möbius grids
TLDR
Two related concepts are investigated: azero blocking set is the complement of a set which is not a zero forcing set, and the zero blocking number is the minimum cardinality of a zero blocking set.
Failed power domination on graphs
TLDR
It is proved that $\bar{\gamma}_p(G)$ is NP-hard to compute, determine graphs in which every vertex is a PDS, and compare $\bar{P)$ to similar parameters.
C O ] 4 S ep 2 01 9 Failed power domination on graphs
Let G be a simple graph with vertex set V and edge set E, and let S ⊆ V . The open neighborhood of v ∈ V , N(v), is the set of vertices adjacent to v; the closed neighborhood is given by N [v] = N(v)
Optimal Sensor Placement in Power Grids: Power Domination, Set Covering, and the Neighborhoods of Zero Forcing Forts
TLDR
A novel integer program for identifying minimum power dominating sets by formulating a set cover problem and showing their structural properties can be separated, allowing the proposed model to be solved via row generation.
Monitoring on Graphs: An Exploration into k-Cores, Zero Forcing, and Power Domination
Monitoring on Graphs: An Exploration into k-Cores, Zero Forcing, and Power Domination
Failed zero forcing and critical sets on directed graphs
Let $D$ be a simple digraph (directed graph) with vertex set $V(D)$ and arc set $A(D)$ where $n=|V(D)|$, and each arc is an ordered pair of distinct vertices. If $(v,u) \in A(D)$, then $u$ is

References

SHOWING 1-8 OF 8 REFERENCES
Failed skew zero forcing on a graph
Abstract Given a graph G and an initial designation of each vertex in V ( G ) as “filled” or “empty,” we apply the skew color change rule, which states that a vertex v becomes filled if and only if
On the Complexity of the Positive Semidefinite Zero Forcing Number
The positive 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
Zero forcing sets and minimum rank of graphs
TLDR
A new graph parameter, Z(G), is introduced that is the minimum size of a zero forcing set of vertices and uses it to bound the minimum rank for numerous families of graphs, often enabling computation of the minimumRank.
Zero forcing parameters and minimum rank problems
The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a graph G, is used to study the maximum nullity/minimum rank of the family of symmetric matrices
Positive Semidefinite Zero Forcing: Complexity and Lower Bounds
TLDR
It is proved that it is NP-complete to find the positive semidefinite zero forcing number of a given graph, and this problem remains NP- complete even for graphs with maximum vertex degree 7.
Fast-mixed searching and related problems on graphs
  • Boting Yang
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 2013
TLDR
This paper establishes a relation between the fast–mixed search problem and the induced-path cover problem, and proves that Fast–Mixed Searching From Leaves is NP-complete, and it remains NP- complete for planar graphs with maximum degree 3.
Full control by locally induced relaxation.
TLDR
A scheme for controlling a large quantum system by acting on a small subsystem only and transferring arbitrary and unknown quantum states from a memory to the large system as well as the inverse ("download access").
Reducibility Among Combinatorial Problems
  • R. Karp
  • Computer Science
    Complexity of Computer Computations
  • 1972