Results 21 to 30 of about 446,887 (277)
Zero forcing in Benzenoid network
Proyecciones (Antofagasta), 2019 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
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
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
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
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 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
Throttling positive semidefinite zero forcing propagation time on graphs [PDF]
, 2018 Zero forcing is a process on a graph that colors vertices blue by starting with some of the vertices blue and applying a color change rule. Throttling minimizes the sum of the size of the initial blue vertex set and the number of the time steps needed to
Carlson, Joshua +7 more
core +4 more sources
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings
Special Matrices, 2014 The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced paths in the graph that cover all ...
Taklimi Fatemeh Alinaghipour +2 more
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
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