Results 31 to 40 of about 6,063,894 (295)

A Lower Bound on the Failed Zero Forcing Number of a Graph [PDF]

, 2022
Given a graph $G=(V,E)$ and a set of vertices marked as filled, we consider a color-change rule known as zero forcing. A set $S$ is a zero forcing set if filling $S$ and applying all possible instances of the color change rule causes all vertices in $V ...
Swanson, Nicolas, Ufferman, Eric
core   +1 more source

Grundy dominating sequences and zero forcing sets

Discrete Optimization, 2017
In a graph $G$ a sequence $v_1,v_2,\dots,v_m$ of vertices is Grundy dominating if for all $2\le i \le m$ we have $N[v_i]\not\subseteq \cup_{j=1}^{i-1}N[v_j]$ and is Grundy total dominating if for all $2\le i \le m$ we have $N(v_i)\not\subseteq \cup_{j=1}^{i-1}N(v_j)$.
Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Balázs Patkós, Zsolt Tuza, Máté Vizer   +7 more
openaire   +5 more sources

Open global shadow graph and it’s zero forcing number

, 2023
Zero forcing number of a graph is the minimum cardinality of the zero forcing set. A zero forcing set is a set of black vertices of minimum cardinality that can colour the entire graph black using the color change rule: each vertex of G is coloured ...
Malur, Raksha, Dominic, Charles
core   +1 more source

Zero forcing parameters and minimum rank problems [PDF]

, 2010
The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a graph G, is used to study the maximum nullity/minimum rank of the family of symmetric matrices described by G.
Holst, van der, H., Fallat, S.M., Hall, H. Tracy, Hogben, L., Shader, Bryan, Barrett, W., Barrett, Wayne, van den Driessche, P., Hall, H.T., Shader, B.L., Fallat, Shaun, Hogben, Leslie, Barioli, F., Driessche, van den, P., Barioli, Francesco, van der Holst, Hein   +15 more
core   +1 more source

Monitoring of water and carbon fluxes using a land data assimilation system: a case study for southwestern France [PDF]

Hydrology and Earth System Sciences, 2010
A Land Data Assimilation System (LDAS) able to ingest surface soil moisture (SSM) and Leaf Area Index (LAI) observations is tested at local scale to increase prediction accuracy for water and carbon fluxes.
C. Albergel, J.-C. Calvet, J.-F. Mahfouf, C. Rüdiger, A. L. Barbu, S. Lafont, J.-L. Roujean, J. P. Walker, M. Crapeau, J.-P. Wigneron   +9 more
doaj   +1 more source

Zero forcing with random sets

Discrete Mathematics
22 pages, 5 ...
Bryan Curtis, Luyining Gan, Jamie Haddock, Rachel Lawrence, Sam Spiro   +4 more
openaire   +4 more sources

On the error of a priori sampling: Zero forcing sets and propagation time

Linear Algebra and its Applications, 2019
17 ...
Franklin H.J. Kenter, Jephian C.-H. Lin
openaire   +4 more sources

Zero forcing sets and the minimum rank of graphs

Linear Algebra and its Applications, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barioli, Francesco, Barrett, Wayne, Butler, Steve, Cioabă, Sebastian, Cvetković, Dragoš, Fallat, Shaun, Godsil, Chris, Haemers, Willem, Hogben, Leslie, Mikkelson, Rana, Narayan, Sivaram, Pryporova, Olga, Sciriha, Irene, So, Wasin, Stevanović, Dragan, van der Holst, Hein, Vander Meulen, Kevin, Wangsness Wehe, Amy   +17 more
openaire   +4 more sources

Zero forcing for inertia sets

, 2012
Zero forcing is a combinatorial game played on a graph with a goal of turning all of the vertices of the graph black while having to use as few "unforced" moves as possible. This leads to a parameter known as the zero forcing number which can be used to give an upper bound for the maximum nullity of a matrix associated with the graph.
Butler, Steve, Grout, Jason, Hall, H. Tracy   +2 more
openaire   +2 more sources

On minimum rank and zero forcing sets of a graph

Linear Algebra and its Applications, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huang, Liang-Hao, Chang, Gerard J., Yeh, Hong-Gwa   +2 more
openaire   +3 more sources