Results 41 to 50 of about 419,100 (266)
Beamforming Design and Covert Performance Analysis for Full-Duplex Multiantenna System
Complexity, 2021 In this work, a wireless covert communication system with full-duplex (FD) multiantenna receiver is considered. In order to improve the convert performance of the wireless communication system in the FD mode, a scheme based on selection combining/zero ...
Ling Yang +5 more
doaj +1 more source
Zero forcing in iterated line digraphs
, 2018 Zero forcing is a propagation process on a graph, or digraph, defined in linear algebra to provide a bound for the minimum rank problem. Independently, zero forcing was introduced in physics, computer science and network science, areas where line ...
Ferrero, Daniela +2 more
core +1 more source
Failed Zero-Forcing Number in Neutrosophic Graphs
, 2022 New setting is introduced to study failed zero-forcing number and failed zero-forcing neutrosophic-number. Leaf-like is a key term to have these notions. Forcing a vertex to change its color is a type of approach to force that vertex to be zero-like.
openaire +2 more sources
Zero Forcing Number of Some Families of Graphs
Mohyla Mathematical Journal, 2021 The work is devoted to the study of the zero forcing number of some families of graphs. The concept of zero forcing is a relatively new research topic in discrete mathematics, which already has some practical applications, in particular, is used in studies of the minimum rank of the matrices of adjacent graphs. The zero forcing process is an example of
openaire +3 more sources
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 Number of Random Regular Graphs
, 2018 The zero forcing process is an iterative graph colouring process in which at each time step a coloured vertex with a single uncoloured neighbour can force this neighbour to become coloured. A zero forcing set of a graph is an initial set of coloured vertices that can eventually force the entire graph to be coloured.
Bal, Deepak +4 more
openaire +2 more sources
Zero forcing number, Grundy domination number, and their variants [PDF]
Linear Algebra and its Applications, 2019 This paper presents strong connections between four variants of the zero forcing number and four variants of the Grundy domination number. These connections bridge the domination problem and the minimum rank problem. We show that the Grundy domination type parameters are bounded above by the minimum rank type parameters.
openaire +2 more sources
Compute-and-forward transmission scheme in cell-free massive MIMO systems
ICT Express, 2023 Cell-free massive multi-input-multi-output (MIMO) systems comprise a large number of distributed access points (APs) to serve a small number of user equipments (UEs). In this paper, compute-and-forward (CF) is investigated for uplink in cell-free massive
Hua Jiang, Linghong Kong, Sidan Du
doaj +1 more source
The zero forcing polynomial of a graph
, 2018 Zero forcing is an iterative graph coloring process, where given a set of initially colored vertices, a colored vertex with a single uncolored neighbor causes that neighbor to become colored.
Boyer, Kirk +7 more
core +1 more source
Hybrid precoding based on distributed partially-connected structure for multiuser massive MIMO
Tongxin xuebao, 2022 For multiuser massive multiple-input multiple-output (MIMO) systems, to solve the problem of underutilized spatial resources caused by centralized partially-connected structure (PCS) and fixed-matching phase-control algorithm in conventional schemes, a ...
Lei ZHANG, Qin WANG
doaj +2 more sources