Results 11 to 20 of about 23,593 (263)
GCI Fusion-Based Anti-Deception Jamming Algorithm for Distributed Radar [PDF]
Hangkong bingqi, 2022 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
Discussiones Mathematicae Graph Theory, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Randy Davila, Michael A. Henning
openaire +3 more sources
Robust Strong Structural Controllability of Complex Power Systems
Frontiers in Energy Research, 2022 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
, 2022 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
Metric Dimension on Sparse Graphs and its Applications to Zero Forcing Sets [PDF]
SSRN Electronic Journal, 2021 The metric dimension dim(G) of a graph $G$ is the minimum cardinality of a subset $S$ of vertices of $G$ such that each vertex of $G$ is uniquely determined by its distances to $S$. It is well-known that the metric dimension of a graph can be drastically increased by the modification of a single edge.
Nicolas Bousquet 0001 +3 more
openaire +2 more sources
Equalization-Based Beamforming for Secure Multicasting in Multicast Wiretap Channels
IEEE Access, 2021 In this paper, a beamforming scheme is proposed to maximize a secrecy multicast rate (SMR) in the multicast wiretap channel, in which the multiple unauthorized users overhear the multicast messages.
Duckdong Hwang +4 more
doaj +1 more source
Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs [PDF]
IEEE Transactions on Automatic Control, 2014 In this paper, controllability of systems defined on graphs is discussed. We consider the problem of controllability of the network for a family of matrices carrying the structure of an underlying directed graph. A one-to-one correspondence between the set of leaders rendering the network controllable and zero forcing sets is established. To illustrate
Nima Monshizadeh +2 more
openaire +5 more sources
Bounds for the Zero Forcing Number of Graphs with Large Girth
Theory and Applications of Graphs, 2015 The zero-forcing number, Z(G) is an upper bound for the maximum nullity of all symmetric matrices with a sparsity pattern described by the graph. A simple lower bound is δ ≤ Z(G) where δ is the minimum degree.
Randy Davila, Franklin Kenter
doaj +1 more source
Spreading in claw-free cubic graphs [PDF]
Opuscula MathematicaLet \(p \in \mathbb{N}\) and \(q \in \mathbb{N} \cup \lbrace \infty \rbrace\). We study a dynamic coloring of the vertices of a graph \(G\) that starts with an initial subset \(S\) of blue vertices, with all remaining vertices colored white.
Boštjan Brešar +2 more
doaj +1 more source
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
openaire +2 more sources