Results 11 to 20 of about 1,598,535 (218)
Failed Zero-Forcing Number in Neutrosophic Graphs
, 2022 New setting is introduced to study failed zero-forcing number and failed zero-forcing neutrosophic-number. Leaf-like is a key term to have these notions. Forcing a vertex to change its color is a type of approach to force that vertex to be zero-like.
Henry Garrett
core +4 more sources
Characterization of Graphs With Failed Skew Zero Forcing Number of 1 [PDF]
, 2022 Given a graph $G$, the zero forcing number of $G$, $Z(G)$, is the smallest cardinality of any set $S$ of vertices on which repeated applications of the forcing rule results in all vertices being in $S$. The forcing rule is: if a vertex $v$ is in $S$, and exactly one neighbor $u$ of $v$ is not in $S$, then $u$ is added to $S$ in the next iteration ...
Johnson, Aidan +2 more
core +4 more sources
The failed zero forcing number of a graph [PDF]
Involve, a Journal of Mathematics, 2015 Given a graph G, the zero forcing number of G, Z(G), is the smallest cardinality of any set S of vertices on which repeated applications of the color change rule results in all vertices joining S. The color change rule is: if a vertex v is in S, and exactly one neighbor u of v is not in S, then u joins S in the next iteration.
Fetcie, Katherine +2 more
openaire +2 more sources
Expected propagation time for probabilistic zero forcing [PDF]
, 2022 Zero forcing is a coloring process on a graph that was introduced more than fifteen years ago in several different applications. The goal is to color all the vertices blue by repeated use of a (deterministic) color change rule. Probabilistic zero forcing
Hogben, Leslie, Geneson, Jesse
core +2 more sources
Variations of zero forcing and power domination [PDF]
, 2021 Zero forcing is a propagation process on a graph that turns white vertices into blue vertices. In this process, an initial set of vertices in a graph $G$ are chosen to be blue and all others are colored white, then a color-change rule is iteratively ...
Alameda, Joseph, Joseph Alameda
core +1 more source
0034 | Zero Forcing Number in Neutrosophic Graphs
, 2022 In this book, some notions are introduced about “Zero Forcing Number in Neutrosophic Graphs.” Three chapters are devised as “Common Notions”, “Modified Notions” and “Extended Notions”. Three manuscripts are cited as the references of these chapters which
Henry Garrett
core +1 more source
Failed skew zero forcing on a graph
Linear Algebra and its Applications, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ansill, Thomas +3 more
openaire +2 more sources
Minimum rank and failed zero forcing number of graphs
, 2022 20 pages, 3 ...
Abara, Ma. Nerissa M. +1 more
openaire +2 more sources
Zero-Forcing Processes on Proper Interval Graphs and Twisted Hypercubes [PDF]
, 2023 Zero forcing is a graph infection process where a colour change rule is applied iteratively to a graph and an initial set of vertices, S. If S results in the entire graph becoming infected, we call this set a zero forcing set.
Collier, Peter
core +2 more sources
Maximal failed zero forcing sets for products of two graphs
, 2022 17 pages, 8 ...
Abara, Ma. Nerissa M. +1 more
openaire +2 more sources