Results 251 to 260 of about 1,017,243 (285)

Updated scenarios show 1.5°C overshoot is unavoidable but limitable

Gohar L, Mathison C, Sanderson B, Sandstad M, Smith C, Walsh T, Gillett N, Ribes A, Kikstra J, Nicholls Z, Thiery W, Schleussner C, Rogelj J.   +12 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On graphs maximizing the zero forcing number

Discrete Applied Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shou-Jun Xu
exaly   +4 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 Erickson, Leslie Hogben, Nathan Wärnberg   +2 more
exaly   +1 more source

Fractional zero forcing via three-color forcing games [PDF]

Discrete Applied Mathematics, 2016
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.
David Robérson, Leslie Hogben, Michael Young   +2 more
exaly   +1 more source

Zero forcing in iterated line digraphs

Discrete Applied Mathematics, 2019
Zero forcing is a propagation process on a graph, or digraph, defined in linear algebra to provide a bound for the minimum rank problem. Independently, zero forcing was introduced in physics, computer science and network science, areas where line ...
Sudeep Stephen, Thomas Kalinowski, Daniela Ferrero   +2 more
exaly   +2 more sources

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