Results 21 to 30 of about 23,593 (263)
ZERO FORCING NUMBER AND MAXIMUM NULLITY OF GENERAL POWER GRAPHS [PDF]
Let Γ = (V,E) be a simple and undirected graph. General power graph of Γ, shown by Pg(Γ), is a graph with the vertex set P(V (Γ))\ϕ. Also two distinct vertices of B and C are adjacent if and only if every b ∈ B is adjacent to every c ∈ C \{b} in Γ.
Fateme Kheiridosst, Ebrahim Vatandoost
doaj +1 more source
Thermal-hydraulic 0D/3D coupling in OpenFOAM: Validation and application in nuclear installations
The nuclear safety assessment involving large transient simulations is forcing the community to develop methods for coupling thermal-hydraulics and neutronic codes and three-dimensional (3D) Computational Fluid Dynamics (CFD) codes.
Santiago F. Corzo +4 more
doaj +1 more source
Grundy dominating sequences and zero forcing sets
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 +7 more
openaire +4 more sources
Monitoring of water and carbon fluxes using a land data assimilation system: a case study for southwestern France [PDF]
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 +9 more
doaj +1 more source
On the error of a priori sampling: Zero forcing sets and propagation time
17 ...
Franklin H.J. Kenter, Jephian C.-H. Lin
openaire +3 more sources
Simulated enhancement of ENSO-related rainfall variability due to Australian dust [PDF]
Australian dust emissions are highly episodic, and this may increase the importance of Australian dust as a climate feedback agent. We compare two 160-year coupled atmosphere-ocean simulations of modern-day climate using the CSIRO Mark 3.6 global climate
L. D. Rotstayn +5 more
doaj +1 more source
On minimum rank and zero forcing sets of a graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huang, Liang-Hao +2 more
openaire +3 more sources
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 +2 more
openaire +2 more sources
Zero forcing sets and the minimum rank of graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barioli, Francesco +17 more
openaire +4 more sources

