Results 31 to 40 of about 1,075,663 (288)
Maximum Oriented Forcing Number for Complete Graphs
Theory and Applications of Graphs, 2019 The \emph{maximum oriented $k$-forcing number} of a simple graph $G$, written $\MOF_k(G)$, is the maximum \emph{directed $k$-forcing number} among all orientations of $G$.
Yair Caro, Ryan Pepper
doaj +1 more source
On the zero forcing number of generalized Sierpinski graphs [PDF]
Transactions on Combinatorics, 2019 In this article we study the Zero forcing number of Generalized Sierpi\'{n}ski graphs $S(G,t)$. More precisely, we obtain a general lower bound on the Zero forcing number of $S(G,t)$ and we show that this bound is tight.
Ebrahim Vatandoost +2 more
doaj +1 more source
Machine Learning-Based Beamforming in K-User MISO Interference Channels
IEEE Access, 2021 In this paper, we consider a K-user multiple-input and single-output interference channel and propose a machine learning-based beamforming design. To circumvent the difficulties of beamforming design in interference channels, we consider a beamforming ...
Hyung Jun Kwon, Jung Hoon Lee, Wan Choi
doaj +1 more source
Bounds for the Zero Forcing Number of Graphs with Large Girth
Theory and Applications of Graphs, 2015 The zero-forcing number, Z(G) is an upper bound for the maximum nullity of all symmetric matrices with a sparsity pattern described by the graph. A simple lower bound is δ ≤ Z(G) where δ is the minimum degree.
Randy Davila, Franklin Kenter
doaj +1 more source
The Bipartite Zero Forcing Set for a Full Sign Pattern Matrix
Mathematics, 2020 For an m × n sign pattern P, we define a signed bipartite graph B ( U , V ) with one set of vertices U = { 1 , 2 , … , m } based on rows of P and the other set of vertices V = { 1 ′ , 2 ′ , … ,
Gu-Fang Mou +2 more
doaj +1 more source
Signed zero forcing number and controllability for a networks system with a directed hypercube [PDF]
MATEC Web of Conferences, 2022 The controllability for complex network system is to find the minimum number of leaders for the network system to achieve effective control of the global networks.
Mou Gufang, Zhang Qiuyan
doaj +1 more source
On the Design of Coherent Zero-Forcing Receiver for the Flat Fading MIMO Multiple-Access Channels [PDF]
Journal of Electrical and Computer Engineering Innovations, 2019 Background and Objectives: Design of low-complexity receiver for space-time block coded (STBC) transmission over multiple-input multiple-output (MIMO) multiple-access channels has been subject of interest over the years.
M. Sheikh-Hosseini
doaj +1 more source
Communications in Science and Technology, 2021 Impulse noise is the major factor degrading the performance of the wireless system, imposing the need for the impulse noise mitigation strategy. Mainly, in the multiple-input multiple-output (MIMO) and orthogonal frequency-division multiplexing (OFDM ...
S. P. Girija, Rameshwar Rao
doaj +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
Maximum nullity and zero forcing of circulant graphs
Special Matrices, 2020 The zero forcing number of a graph has been applied to communication complexity, electrical power grid monitoring, and some inverse eigenvalue problems.
Duong Linh +4 more
doaj +1 more source