Results 31 to 40 of about 3,638,652 (319)
Fractional Zero Forcing via Three-color Forcing Games [PDF]
An $r$-fold analogue of the positive semidefinite zero forcing process that is carried out on the $r$-blowup of a graph is introduced and used to define the fractional positive semidefinite forcing number. Properties of the graph blowup when colored with
Hogben, Leslie +4 more
core +4 more sources
Zero forcing in Benzenoid network
A set S of vertices in a graph G is called a dominating set of G if every vertex in V (G)\S is adjacent to some vertex in S. A set S is said to be a power dominating set of G if every vertex in the system is monitored by the set S following a set of rules for power system monitoring.
Anitha, J., Rajasingh, Indra
openaire +3 more sources
Reconfiguration graphs of zero forcing sets [PDF]
This paper begins the study of reconfiguration of zero forcing sets, and more specifically, the zero forcing graph. Given a base graph $G$, its zero forcing graph, $\mathscr{Z}(G)$, is the graph whose vertices are the minimum zero forcing sets of $G ...
Jesse T. Geneson, R. Haas, L. Hogben
semanticscholar +1 more source
Reliable of High Data Rate Using Spatial Multiplexing and Convolution Code [PDF]
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
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
Automatic Modulation Classification for MIMO Systems via Deep Learning and Zero-Forcing Equalization
Automatic modulation classification (AMC) is one of the most critical technologies for non-cooperative communication systems. Recently, deep learning (DL) based AMC (DL-AMC) methods have attracted significant attention due to their preferable performance.
Yu Wang +8 more
semanticscholar +1 more source
On the zero forcing number of generalized Sierpinski graphs [PDF]
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
Signed zero forcing number and controllability for a networks system with a directed hypercube [PDF]
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
Maximum Oriented Forcing Number for Complete Graphs
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
The Bipartite Zero Forcing Set for a Full Sign Pattern Matrix
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

