Results 1 to 10 of about 446,887 (277)
Logic circuits from zero forcing. [PDF]
Nat Comput, 2015 5 pages, 10 EPS ...
Burgarth D +4 more
europepmc +8 more sources
Fractional Zero Forcing via Three-color Forcing Games [PDF]
Discrete Applied Mathematics, 2015 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. Properties of the graph blowup when colored with
Hogben, Leslie +4 more
core +6 more sources
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 +3 more sources
Dynamic approach to k-forcing [PDF]
Theory and Applications of Graphs, 2015 The k-forcing number of a graph is a generalization of the zero forcing number. In this note, we give a greedy algorithm to approximate the k-forcing number of a graph. Using this dynamic approach, we give corollaries which improve upon two theorems from
Yair Caro, Ryan Pepper
doaj +5 more sources
Zero Forcing Sets and Bipartite Circulants [PDF]
Linear Algebra and its Applications, 2010 In this paper we introduce a class of regular bipartite graphs whose biadjacency matrices are circulant matrices and we describe some of their properties.
Meyer, Seth A.
core +3 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
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
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 +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
Probabilistic zero forcing on random graphs [PDF]
European Journal of Combinatorics, 2021 Zero forcing is a deterministic iterative graph coloring process in which vertices are colored either blue or white, and in every round, any blue vertices that have a single white neighbor force these white vertices to become blue. Here we study probabilistic zero forcing, where blue vertices have a non-zero probability of forcing each white neighbor ...
English, Sean +2 more
openaire +3 more sources