Results 251 to 260 of about 1,075,663 (288)

Delay-Embedded Neural Reconstruction for Indirect Sensing in Electrical and Micromechanical Oscillating Systems. [PDF]

Sensors (Basel)
Grimaldi F, Geminiani C, Tilli A.
europepmc   +1 more source

Impact attribution of anthropogenic forcing on lake surface temperature. [PDF]

Nat Commun
Wang X, Shi K, Qin B, Woolway RI.
europepmc   +1 more source

Multiyear tropical warm pool warming drives slowdown in Antarctic mass loss. [PDF]

Nature
Wang Y, Ding Q, Li X, Ballinger TJ, Nakayama Y, Topál D, Steig EJ.   +6 more
europepmc   +1 more source

The Zero Forcing Number of Graphs [PDF]

SIAM Journal on Discrete Mathematics, 2019
A subset $S$ of initially infected vertices of a graph $G$ is called zero forcing if we can infect the entire graph by iteratively applying the following process. At each step, any infected vertex which has a unique uninfected neighbor, infects this neighbor. The zero forcing number of $G$ is the minimum cardinality of a zero forcing set in $G$.
Thomas Kalinowski, Benny Sudakov, Nina Kamčev   +2 more
exaly   +5 more sources

Positive Semidefinite Zero Forcing [PDF]

Linear Algebra and Its Applications, 2013
The positive semidefinite zero forcing number Z+(G) of a graph G was introduced in [4]. We establish a variety of properties of Z+(G): Any vertex of G can be in a minimum positive semidefinite zero forcing set (this is not true for standard zero forcing).
Craig Jeremy Erickson, Leslie Hogben, Nathan Wärnberg   +2 more
exaly   +1 more source

The Zero Forcing Polynomial of a Graph

Discrete Applied Mathematics, 2019
23 ...
Sean Joseph English, Daniela Ferrero, Carolyn Reinhart   +2 more
exaly   +5 more sources

Reconfiguration Graphs of Zero Forcing Sets

Discrete Applied Mathematics, 2023
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$ with an edge between vertices $B$ and $B'$ of $\mathscr{Z}(G)$ if and only if $B$ can be obtained from $
Leslie Hogben, Ruth Haas, Jesse T. Geneson   +2 more
exaly   +5 more sources

Some of the next articles are maybe not open access.

Related searches:

Fuzzification of Zero Forcing Process

New Mathematics and Natural Computation, 2020
In this paper, we investigate the fuzzification of zero forcing process. For this, first we introduce a new embedding of a graph [Formula: see text] by considering a minimal zero forcing set of [Formula: see text] and an arbitrary list of maximal forcing chains of this zero forcing set.
Rajab Ali Borzooei, B. Sheikh Hoseini, M. Golmohammadian, Zahra Montazeri, Mohammad Mohseni Takallo   +4 more
openaire   +2 more sources

On Extremal Graphs for Zero Forcing Number

Graphs and Combinatorics, 2022
For a graph \(G\) with \(S\subseteq V(G)\), \(S\) is a zero forcing set of \(G\) if iteratively adding vertices to \(S\) from \(V(G)\setminus S\) that are the unique neighbor in \(V(G)\setminus S\) of some vertex in \(S\), results in the entire \(V(G)\) of \(G\).
Yi-Ping Liang, Jianxi Li, Shou-Jun Xu
openaire   +1 more source

Zero Forcing in triangulations

Journal of Computational and Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carlos G. Hernández, José Ranilla, Sandra Ranilla-Cortina   +2 more
openaire   +3 more sources