Results 1 to 10 of about 4,814 (224)
Characterization of All Graphs with a Failed Skew Zero Forcing Number of 1
Mathematics, 2022 Given a graph G, the zero forcing number of G, Z(G), is the minimum cardinality of any set S of vertices of which repeated applications of the forcing rule results in all vertices being in S.
Aidan Johnson +2 more
doaj +5 more sources
All Graphs with a Failed Zero Forcing Number of Two [PDF]
Symmetry, 2021 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.
Luis Gomez +3 more
exaly +4 more sources
An Inverse Approach for Finding Graphs with a Failed Zero Forcing Number of k
Mathematics, 2023 For a 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 included in S.
Chirag Kaudan +2 more
doaj +3 more sources
A lower bound on the failed zero-forcing number of a graph
Involve, 2023 11 pages, 13 figures.
Swanson, Nicolas, Ufferman, Eric
exaly +5 more sources
Failed Zero Forcing Numbers of Trees and Circulant Graphs
Theory and Applications of GraphsGiven 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 (described below) results in all vertices being in $S$.
Luis Gomez +4 more
doaj +4 more sources
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
The failed zero forcing number of a graph [PDF]
Involve, 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.
Bonnie Jacob
exaly +3 more sources
On the complexity of failed zero forcing
Theoretical Computer Science, 2017 5 ...
Yaroslav Shitov
exaly +3 more sources
Failed Skew Zero Forcing Numbers of Path Powers and Circulant Graphs
AppliedMathFor a graph G, the zero forcing number of G, Z(G), is defined to be the minimum cardinality of a set S of vertices for which repeated applications of the forcing rule results in all vertices being in S. The forcing rule is as follows: if a vertex v is in
Aidan Johnson +3 more
doaj +2 more sources
Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph [PDF]
Neutrosophic Sets and Systems, 2022 New setting is introduced to study dominating, resolving, coloring, Eulerian(Hamiltonian) neutrosophic path, n-Eulerian(Hamiltonian) neutrosophic path, zero forcing number, zero forcing neutrosophicnumber, independent number, independent neutrosophic ...
Henry Garrett
doaj +1 more source