Results 201 to 210 of about 1,598,535 (218)

On the Complexity of Failed Zero Forcing

open access: yesTheoretical Computer Science, 2017
5 ...
Yaroslav Shitov
exaly   +3 more sources

Failed 2-Distance Zero Forcing in Graphs

open access: yesEuropean Journal of Pure and Applied Mathematics
Let $G$ be a graph with vertex and edge-sets $E(G)$ and $V(G)$, respectively. Then $M\subset V(G)$ is called a failed 2-distance zero forcing set of $G$ if $M$ is not a 2-distance zero forcing set of $G$. The failed 2-distance zero forcing number of a graph $G$, denoted by $F^2(G)$, is the maximum cardinality of a failed 2-distance zero forcing set. In
Javier Hassan
exaly   +2 more sources

Positive Semidefinite Zero Forcing [PDF]

open access: yesLinear Algebra and Its Applications, 2013
The positive semidefinite zero forcing number Z+(G) of a graph G was introduced in [4]. We establish a variety of properties of Z+(G): Any vertex of G can be in a minimum positive semidefinite zero forcing set (this is not true for standard zero forcing).
Craig Jeremy Erickson   +2 more
exaly   +1 more source
Some of the next articles are maybe not open access.

Related searches:

Failed Zero Forcing Numbers of Kneser Graphs, Johnson Graphs, and Hypercubes

Journal of Applied Mathematics and Computing
Hamid Reza Maimani   +1 more
exaly   +4 more sources

Fractional Zero Forcing via Three-Color Forcing Games [PDF]

open access: yesDiscrete Applied Mathematics, 2016
An r-fold analogue of the positive semidefinite zero forcing process that is carried out on the r-blowup of a graph is introduced and used to define the fractional positive semidefinite forcing number.
David E Robérson   +2 more
exaly   +1 more source

Failed zero forcing

Given a graph G, a set S ⊆ V (G) is called a zero forcing set if repeatedly applying the following colour change rule results in all vertices of G being coloured black: if a black vertex v has exactly one white neighbour u, then u becomes black. The zero forcing number Z(G) is the size of the smallest zero forcing set of G.
openaire   +1 more source

Reconfiguration Graphs of Zero Forcing Sets

Discrete Applied Mathematics, 2023
Leslie Hogben   +2 more
exaly  

Failed zero forcing numbers of grassmann graphs

Afzali, Fatemeh   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy