Results 11 to 20 of about 5,825,526 (293)
Zero forcing irredundant sets [PDF]
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 +7 more sources
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs
This paper presents new complexity and non-approximation results concerning two color propagation problems, namely Power Edge Set and Zero Forcing Set. We focus on cubic graphs, exploiting their structural properties to improve and refine previous results.
Cazals, Pierre +4 more
openaire +4 more sources
Using variants of zero forcing to bound the inertia set of a graph
Zero forcing is a combinatorial game played on a graph with a goal of changing the color of every vertex at minimal cost. This leads to a parameter known as the zero forcing number that can be used to give an upper bound for the maximum nullity of a matrix associated with the graph. A variation on the zero forcing game is introduced that can be used to
Steve Butler, Jason Grout, H. Hall
openaire +2 more sources
Exploring the influence of graph operations on zero forcing sets [PDF]
Zero forcing in graphs is a coloring process where a colored vertex can force its unique uncolored neighbor to be colored. A zero forcing set is a set of initially colored vertices capable of eventually coloring all vertices of the graph. In this paper, we focus on the numbers $z(G; i)$, which is the number of zero forcing sets of size $i$ of the graph
Krishna Menon, Anurag Singh 0003
core +6 more sources
Impact of negative and positive CO2 emissions on global warming metrics using an ensemble of Earth system model simulations [PDF]
The benefits of implementing negative emission technologies in the global warming response to cumulative carbon emissions until the year 2420 are assessed following the shared socioeconomic pathway (SSP) 1-2.6, the sustainable development scenario, with ...
N. Vakilifard +7 more
doaj +1 more source
GCI Fusion-Based Anti-Deception Jamming Algorithm for Distributed Radar [PDF]
Aiming at the anti-jamming problem of distributed radar against multiple false targets, an anti-jamming algorithm based on data level fusion is proposed. Firstly, the cardinalized probability hypothesis density (CPHD) filter based on random finite set is
Zhu Yongfeng, Da Kai, Yang Ye
doaj +1 more source
Total forcing sets and zero forcing sets in trees
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Randy Davila, Michael A. Henning
openaire +4 more sources
Robust Strong Structural Controllability of Complex Power Systems
Ensuring the control of power systems is crucial for their safe operation. This paper analyses the robust controllability of complex power systems from the structural sighta structural point of view.
Yunhe Sun +3 more
doaj +1 more source
Variations of zero forcing and power domination [PDF]
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
core +1 more source
In this paper, we study minimal (with respect to inclusion) zero forcing sets. We first investigate when a graph can have polynomially or exponentially many distinct minimal zero forcing sets. We also study the maximum size of a minimal zero forcing set $\overline{\operatorname{Z}}(G)$, and relate it to the zero forcing number $\operatorname{Z}(G ...
Brimkov, Boris, Carlson, Joshua
openaire +3 more sources

