Results 11 to 20 of about 1,064,288 (288)
Zero forcing irredundant sets [PDF]
Australas. J Comb.Irredundance has been studied in the context of dominating sets, via the concept of private neighbor. Here irredundance of zero forcing sets is introduced via the concept of a private fort and the upper and lower zero forcing irrdedundance numbers $\mbox{ZIR}(G)$ and $\mbox{zir}(G)$ are defined.
Bryan Curtis +2 more
core +6 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 applied until all of $G$ becomes blue.
Alameda, Joseph, Joseph Alameda
openaire +5 more sources
Zero forcing in Benzenoid network
Proyecciones (Antofagasta), 2019 A set S of vertices in a graph G is called a dominating set of G if every vertex in V (G)\S is adjacent to some vertex in S. A set S is said to be a power dominating set of G if every vertex in the system is monitored by the set S following a set of rules for power system monitoring.
Anitha, J., Rajasingh, Indra
openaire +4 more sources
We introduce randomized zero forcing (RZF), a stochastic color-change process on directed graphs in which a white vertex turns blue with probability equal to the fraction of its incoming neighbors that are blue. Unlike probabilistic zero forcing, RZF is governed by in-neighborhood structure and can fail to propagate globally due to directionality.
Jesse Geneson +4 more
openaire +4 more sources
Rigid Linkages and Partial Zero Forcing [PDF]
The Electronic Journal of Combinatorics, 2019 Connections between vital linkages and zero forcing are established. Specifically, the notion of a rigid linkage is introduced as a special kind of unique linkage and it is shown that spanning forcing paths of a zero forcing process form a spanning rigid linkage and thus a vital linkage.
Daniela Ferrero +7 more
openaire +6 more sources
An approximation algorithm for zero forcing
Discrete Applied MathematicsWe give an algorithm that finds a zero forcing set which approximates the optimal size by a factor of $\text{pw}(G)+1$, where $\text{pw}(G)$ is the pathwidth of $G$. Starting from a path decomposition, the algorithm runs in $O(nm)$ time, where $n$ and $m$ are the order and size of the graph, respectively.
Ben Cameron +3 more
openaire +4 more sources
Zero and total forcing dense graphs
Discussiones Mathematicae Graph Theory, 2023 Summary: If \(S\) is a set of colored vertices in a simple graph \(G\), then one may allow a colored vertex with exactly one non-colored neighbor to force its non-colored neighbor to become colored. If by iteratively applying this color change rule, all of the vertices in \(G\) become colored, then \(S\) is a zero forcing set of \(G\).
Randy Davila +2 more
doaj +3 more sources
Leaky Zero-Forcing Adaptive Equalization
IEEE Signal Processing Letters, 2004 Zero-forcing equalizer adaptation schemes are attractive because of their simplicity. We study their steady-state solution, and find that it is more poorly conditioned than that of least mean-square adaptation schemes. A simple yet effective solution to this problem, based on tap leakage, is proposed, analyzed, and exemplified for an idealized digital ...
Bergmans, J.W.M., Lin, M.Y.
openaire +3 more sources
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 ...
Sean English +2 more
openaire +4 more sources
Properties of a q-Analogue of Zero Forcing [PDF]
Graphs and Combinatorics, 2020 Zero forcing is a combinatorial game played on a graph where the goal is to start with all vertices unfilled and to change them to filled at minimal cost. In the original variation of the game there were two options. Namely, to fill any one single vertex at the cost of a single token; or if any currently filled vertex has a unique non-filled neighbor ...
Steve Butler +8 more
openaire +4 more sources