Results 41 to 50 of about 9,485,710 (280)
Critical ideals, minimum rank and zero forcing number [PDF]
Applied Mathematics and Computation, 2019 There are profound relations between the zero forcing number and minimum rank of a graph. We study the relation of both parameters with a third one, the algebraic co-rank; that is defined as the largest $i$ such that the $i$-th critical ideal is trivial. This gives a new perspective for bounding and computing these three graph parameters.
Carlos A. Alfaro, Jephian C.-H. Lin
openaire +4 more sources
PERFORMANCE ANALYSIS AND EVALUATION OF MASSIVE MIMO SYSTEM [PDF]
Applied Computer Science, 2020 This article examines the performance of massive MIMO uplink system over Rician fading channel. The performance is estimated regarding spectral efficiency versus number of base station antennas utilizing three plans of linear detection, maximum-ratio ...
Muaayed F. AL-RAWI +2 more
doaj +2 more sources
Positive semidefinite maximum nullity and zero forcing number [PDF]
, 2012 The zero forcing number is used to study the maximum nullity/minimum rank of the family of symmetric matrices described by a simple, undirected graph. We study the positive semidefinite zero forcing number and some of its properties.
Peters, Travis
core +1 more source
On the complexity of the positive semidefinite zero forcing number
Linear Algebra and its Applications, 2016 The positive semidefinite zero forcing number of a graph is a graph parameter that arises from a non-traditional type of graph colouring and is related to a more conventional version of zero forcing. We establish a relation between the zero forcing and the fast–mixed searching, which implies some NP-completeness results for the zero forcing problem ...
Meagher, Karen +2 more
openaire +3 more sources
Families of graphs with maximum nullity equal to zero forcing number
Special Matrices, 2018 The maximum nullity of a simple graph G, denoted M(G), is the largest possible nullity over all symmetric real matrices whose ijth entry is nonzero exactly when fi, jg is an edge in G for i =6 j, and the iith entry is any real number.
Alameda Joseph S. +7 more
doaj +1 more source
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
On Zero Forcing Number of Functigraphs
, 2012 \emph{Zero forcing number}, $Z(G)$, of a graph $G$ is the minimum cardinality of a set $S$ of black vertices (whereas vertices in $V(G) \setminus S$ are colored white) such that $V(G)$ is turned black after finitely many applications of "the color-change rule": a white vertex is converted black if it is the only white neighbor of a black vertex.
Kang, Cong X., Yi, Eunjeong
openaire +2 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
Propagation time for probabilistic zero forcing [PDF]
, 2018 Zero forcing is a coloring game played on a graph that was introduced more than ten years ago in several different applications. The goal is to color all the vertices blue by repeated use of a (deterministic) color change rule. Probabilistic zero forcing
Hogben, Leslie, Geneson, Jesse
core
, 2017 A subset $S$ of initially infected vertices of a graph $G$ is called forcing if we can infect the entire graph by iteratively applying the following process. At each step, any infected vertex which has a unique uninfected neighbour, infects this neighbour. The forcing number of $G$ is the minimum cardinality of a forcing set in $G$.
Kalinowski, Thomas +2 more
openaire +2 more sources