Results 21 to 30 of about 1,075,663 (288)
Expected propagation time for probabilistic zero forcing [PDF]
, 2022 Zero forcing is a coloring process on a graph that was introduced more than fifteen 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 +2 more sources
Zero-Forcing Processes on Proper Interval Graphs and Twisted Hypercubes [PDF]
, 2023 Zero forcing is a graph infection process where a colour change rule is applied iteratively to a graph and an initial set of vertices, S. If S results in the entire graph becoming infected, we call this set a zero forcing set.
Collier, Peter
core +2 more sources
, 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
On zero forcing number of graphs and their complements [PDF]
Discrete Mathematics, Algorithms and Applications, 2015 The 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 white vertex is converted to a black vertex if it is the only white neighbor of a black vertex.
Linda Eroh, Cong X. Kang, Eunjeong Yi
openaire +4 more sources
Line graphs: their maximum nullities and zero forcing numbers [PDF]
, 2008 summary:The maximum nullity over a collection of matrices associated with a graph has been attracting the attention of numerous researchers for at least three decades.
Fallat, Shaun +12 more
core +1 more source
Improved Signal Detection Techniques for QOSTBC System in Fast Fading Channel
Journal of Telecommunications and Information Technology, 2020 Most existing quasi-orthogonal space time block coding (QO-STBC) schemes have been developed relying on the assumption that the channel is flat or remains static during the length of the code word symbol periods to achieve an optimal antenna diversity ...
Jyoti Prasanna Patra, Poonam Singh
doaj +1 more source
Diversity analysis of two-way MIMO relaying system based on zero-forcing [PDF]
, 2012 The two-way multiple-input and multiple-output relay system is investigated in this paper, where bi-directional communications between two source nodes are supported by a relay node with multiple antennas.
Xiang, Wei +7 more
core +1 more source
Analytical Framework of CP-Free Multiuser OFDM System for Coordinated Multi-Point at mmWave
Applied Sciences, 2021 In this paper, a coordinated multipoint joint transmission (CoMP-JT) framework at mmWave for a cyclic prefix (CP)-free multiuser OFDM wireless communication system is developed and analyzed.
Joarder Jafor Sadique +7 more
doaj +1 more source
0034 | Zero Forcing Number in Neutrosophic Graphs
, 2022 In this book, some notions are introduced about “Zero Forcing Number in Neutrosophic Graphs.” Three chapters are devised as “Common Notions”, “Modified Notions” and “Extended Notions”. Three manuscripts are cited as the references of these chapters which
Henry Garrett
core +1 more source
Reliable of High Data Rate Using Spatial Multiplexing and Convolution Code [PDF]
Engineering and Technology Journal, 2015 Spatial Multiplexing (SM) can be achieved higher transmission rate without allocating higher bandwidth or increasing transmit power, so it is wildly used recently to serve the extremely demand of mobile communications.
Eman A. Farhan +2 more
doaj +1 more source