Results 31 to 40 of about 419,100 (266)
A Comparison between the Zero Forcing Number and the Strong Metric Dimension of Graphs [PDF]
, 2014 The \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)-S$ are colored white) such that $V(G)$ is turned black after finitely many applications of "the color-change rule":
A Sebö +19 more
core +1 more source
A lower bound on the zero forcing number [PDF]
Discrete Applied Mathematics, 2018 In this note, we study a dynamic vertex coloring for a graph $G$. In particular, one starts with a certain set of vertices black, and all other vertices white. Then, at each time step, a black vertex with exactly one white neighbor forces its white neighbor to become black.
Randy Davila +2 more
openaire +4 more sources
The Journal of Engineering, 2020 Comparison and analysis of the regularised zero forcing precoder, rapid numerical algorithms-based precoder and the truncated polynomial expansion-based precoder are done for massive multiple-input multiple-output wireless system for multicell scenario ...
Emmanuel Mukubwa, Oludare A. Sokoya
doaj +1 more source
Precoding and Beamforming Techniques in mmWave-Massive MIMO: Performance Assessment
IEEE Access, 2022 Massive MIMO and mmWave communication are the technologies for achieving 5G design goals. Fortunately, these two technologies share a symbiotic integration.
Tewelgn Kebede +4 more
doaj +1 more source
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
Performance evaluation of channel estimation techniques in a multiple antenna OFDM system [PDF]
, 2003 A number of pilot-based channel estimation techniques are investigated for a multiple antenna system using the zero-forcing algorithm. The techniques are tested in typical indoor and outdoor (vehicular) channels.
Dowler, ASH, Nix, AR
core +1 more source
, 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
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
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
Constructions of cospectral graphs with different zero forcing numbers
The Electronic Journal of Linear Algebra, 2022 Several researchers have recently explored various graph parameters that can or cannot be characterized by the spectrum of a matrix associated with a graph. In this paper, we show that several NP-hard zero forcing numbers are not characterized by the spectra of several types of associated matrices with a graph.
Aida Abiad +5 more
openaire +5 more sources