Results 21 to 30 of about 1,017,243 (285)
Probabilistic zero forcing on random graphs [PDF]
Zero forcing is a deterministic iterative graph coloring process in which vertices are colored either blue or white, and in every round, any blue vertices that have a single white neighbor force these white vertices to become blue. Here we study probabilistic zero forcing, where blue vertices have a non-zero probability of forcing each white neighbor ...
Sean English +2 more
openaire +4 more sources
Expected propagation time for probabilistic zero forcing [PDF]
Zero forcing is a coloring process on a graph that was introduced more than fifteen years ago in several different applications. The goal is to color all the vertices blue by repeated use of a (deterministic) color change rule. Probabilistic zero forcing
Hogben, Leslie, Geneson, Jesse
core +3 more sources
Properties of a q-Analogue of Zero Forcing [PDF]
Zero forcing is a combinatorial game played on a graph where the goal is to start with all vertices unfilled and to change them to filled at minimal cost. In the original variation of the game there were two options. Namely, to fill any one single vertex at the cost of a single token; or if any currently filled vertex has a unique non-filled neighbor ...
Steve Butler +8 more
openaire +4 more sources
RIS-Aided Zero-Forcing and Regularized Zero-Forcing Beamforming in Integrated Information and Energy Delivery [PDF]
This paper considers a network of a multi-antenna array base station (BS) and a reconfigurable intelligent surface (RIS) to deliver both information to information users (IUs) and power to energy users (EUs). The RIS links the connection between the IUs and the BS as there is no direct path between the former and the latter.
Hongwen Yu +4 more
openaire +5 more sources
Fuzzy Forcing Set on Fuzzy Graphs [PDF]
The investigation of impact of fuzzy sets on zero forcing set is the main aim of this paper. According to this, results lead us to a new concept which we introduce it as Fuzzy Zero Forcing Set (FZFS). We propose this concept and suggest a polynomial time
Layia Aliahmadipour, Saeedeh Rashidi
doaj +1 more source
Forcing Parameters in Fully Connected Cubic Networks
Domination in graphs has been extensively studied and adopted in many real life applications. The monitoring electrical power system is a variant of a domination problem called power domination problem.
Yongsheng Rao +4 more
doaj +1 more source
On zero forcing number of graphs and their complements [PDF]
The 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 white vertex is converted to a black vertex if it is the only white neighbor of a black vertex.
Linda Eroh, Cong X. Kang, Eunjeong Yi
openaire +4 more sources
In this paper, we study minimal (with respect to inclusion) zero forcing sets. We first investigate when a graph can have polynomially or exponentially many distinct minimal zero forcing sets. We also study the maximum size of a minimal zero forcing set $\overline{\operatorname{Z}}(G)$, and relate it to the zero forcing number $\operatorname{Z}(G ...
Brimkov, Boris, Carlson, Joshua
openaire +3 more sources
Line graphs: their maximum nullities and zero forcing numbers [PDF]
summary:The maximum nullity over a collection of matrices associated with a graph has been attracting the attention of numerous researchers for at least three decades.
Fallat, Shaun +12 more
core +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

