Results 31 to 40 of about 9,977,087 (284)
A lower bound on the failed zero-forcing number of a graph
11 pages, 13 figures.
Swanson, Nicolas, Ufferman, Eric
openaire +3 more sources
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
Diversity analysis of two-way MIMO relaying system based on zero-forcing [PDF]
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
Precoding and Beamforming Techniques in mmWave-Massive MIMO: Performance Assessment
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
Forts, (fractional) zero forcing, and Cartesian products of graphs [PDF]
The (disjoint) fort number and fractional zero forcing number are introduced and related to existing parameters including the (standard) zero forcing number.
Cameron, Thomas R. +4 more
core +2 more sources
Line graphs: Their maximum nullities and zero forcing numbers [PDF]
The main aim of this paper is to analyze the maximum nullity and zero forcing number, and their positive counterparts, for general families of line graphs associated with graphs possessing some specific properties. In [\textit{F. Barioli} et al., Linear Algebra Appl. 428, No.
Fallat, Shaun, Soltani, Abolghasem
openaire +2 more sources
Zero forcing number: Results for computation and comparison with other graph parameters [PDF]
The zero forcing number of a graph is the minimum size of a zero forcing set. This parameter is useful in the minimum rank/maximum nullity problem, as it gives an upper bound to the maximum nullity.
Darren Daniel Row, Row, Darren
core +1 more source
Families of graphs with maximum nullity equal to zero forcing number
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
On the complexity of the positive semidefinite zero forcing number
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
This thesis comprises the results of five research papers on domination and zero forcing. In "Largest Domination Number and Smallest Independence Number of Forests with given Degree Sequence" (Gentner, Henning, Rautenbach, 2016) and "Smallest Domination
Gentner, Michael
core +1 more source

