Results 31 to 40 of about 409,696 (282)

Maximal failed zero forcing sets for products of two graphs

, 2022
17 pages, 8 ...
Abara, Ma. Nerissa M., Pelayo, Prince Allan B.   +1 more
openaire   +2 more sources

DropNet: An Improved Dropping Algorithm Based on Neural Networks for Line-of-Sight Massive MIMO

IEEE Access, 2021
In line-of-sight massive MIMO, the downlink channel vectors of few users may become highly correlated. This high correlation limits the sum-rates of systems employing linear precoders.
Amirashkan Farsaei, Alireza Sheikh, Ulf Gustavsson, Alex Alvarado, Frans M. J. Willems   +4 more
doaj   +1 more source

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ö, CJ Edholm, CX Kang, CX Kang, D Burgarth, D Burgarth, DD Row, E Yi, F Barioli, F Barioli, F Harary, G Chartrand, K Chilakamarri, L Eroh, L Hogben, MR Garey, OR Oellermann, PJ Slater, S Khuller, S Severini   +19 more
core   +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, Brimkov, Boris, English, Sean, Ferrero, Daniela, Keller, Ariel, Kirsch, Rachel, Phillips, Michael, Reinhart, Carolyn   +7 more
core   +1 more source

Zero forcing for inertia sets

, 2012
Zero forcing is a combinatorial game played on a graph with a goal of turning all of the vertices of the graph black while having to use as few "unforced" moves as possible. This leads to a parameter known as the zero forcing number which can be used to give an upper bound for the maximum nullity of a matrix associated with the graph.
Butler, Steve, Grout, Jason, Hall, H. Tracy   +2 more
openaire   +2 more sources

Closed-Form Power Normalization Methods for a Satellite MIMO System

Sensors, 2022
The paper proposes a new set of normalization techniques for precoding/beamforming matrices applicable to broadband multiuser multiple-input multiple-output (MIMO) satellite systems.
Andrea Segneri, Alejandro Baldominos, George Goussetis, Alberto Mengali, Nelson J. G. Fonseca   +4 more
doaj   +1 more source

Zero forcing with random sets

Discrete Mathematics
22 pages, 5 ...
Curtis, Bryan, Gan, Luyining, Haddock, Jamie, Lawrence, Rachel, Spiro, Sam   +4 more
openaire   +3 more sources

Recognizable Languages of k-Forcing Automata

Mathematical and Computational Applications
In this study, we show that automata theory is also a suitable tool for analyzing a more complex type of the k-forcing process. First, the definition of k-forcing automata is presented according to the definition of k-forcing for graphs.
Marzieh Shamsizadeh, Mohammad Mehdi Zahedi, Khadijeh Abolpour, Manuel De la Sen   +3 more
doaj   +1 more source

Nutritional management and maize variety combination effectively control Striga asiatica in southern Africa

CABI Agriculture and Bioscience, 2022
Maize (Zea mays L.) is an important staple food crop in sub-Saharan Africa (SSA) and contributes significantly to food security. Due to Striga, maize yield loss is estimated between 20 and 80% forcing some farmers to abandon their land therefore ...
Simbarashe Mutsvanga, Edmore Gasura, Peter S. Setimela, Cacious S. Nyakurwa, Stanford Mabasa   +4 more
doaj   +1 more source

Zero forcing number, constrained matchings and strong structural controllability

, 2015
The zero forcing number is a graph invariant introduced to study the minimum rank of the graph. In 2008, Aazami proved the NP-hardness of computing the zero forcing number of a simple undirected graph.
Delvenne, Jean-Charles, Trefois, Maguy
core   +1 more source