Results 1 to 10 of about 32,735 (116)
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 +3 more sources
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings
Special Matrices, 2014 The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced paths in the graph that cover all ...
Taklimi Fatemeh Alinaghipour +2 more
doaj +2 more sources
Logic Circuits From Zero Forcing [PDF]
Natural Computing, 2015 Simone Severini +2 more
exaly +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
GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED [PDF]
Journal of Algebraic Systems, 2021 A subset of the vertex set of a graph $G$ is called a zero forcing set if by considering them colored and, as far as possible, a colored vertex with exactly one non-colored neighbor forces its non-colored neighbor to get colored, then the whole vertices ...
M. Alishahi, E. Rezaei-Sani
doaj +1 more source
Connected zero forcing sets and connected propagation time of graphs [PDF]
Transactions on Combinatorics, 2020 The zero forcing number $Z(G)$ of a graph $G$ is the minimum cardinality of a set $S$ with colored (black) vertices which forces the set $V(G)$ to be colored (black) after some times.
Maryam Khosravi +2 more
doaj +1 more source
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 +1 more source
Fuzzy Forcing Set on Fuzzy Graphs [PDF]
Journal of Mahani Mathematical Research, 2019 The investigation of impact of fuzzy sets on zero forcing set is the main aim of this paper. According to this, results lead us to a new concept which we introduce it as Fuzzy Zero Forcing Set (FZFS). We propose this concept and suggest a polynomial time
Layia Aliahmadipour, Saeedeh Rashidi
doaj +1 more source
Forcing Parameters in Fully Connected Cubic Networks
Mathematics, 2022 Domination in graphs has been extensively studied and adopted in many real life applications. The monitoring electrical power system is a variant of a domination problem called power domination problem.
Yongsheng Rao +4 more
doaj +1 more source
Total Forcing Sets and Zero Forcing Sets in Trees
Discussiones Mathematicae Graph Theory, 2020 A dynamic coloring of the vertices of a graph G starts with an initial subset S of colored vertices, with all remaining vertices being non-colored. At each discrete time interval, a colored vertex with exactly one non-colored neighbor forces this non ...
Davila Randy, Henning Michael A.
doaj +1 more source