Results 11 to 20 of about 8,040,567 (219)
Characterization of Graphs With Failed Skew Zero Forcing Number of 1 [PDF]
, 2022 Given a graph $G$, the zero forcing number of $G$, $Z(G)$, is the smallest cardinality of any set $S$ of vertices on which repeated applications of the forcing rule results in all vertices being in $S$. The forcing rule is: if a vertex $v$ is in $S$, and exactly one neighbor $u$ of $v$ is not in $S$, then $u$ is added to $S$ in the next iteration ...
Johnson, Aidan +2 more
openaire +3 more sources
0034 | Zero Forcing Number in Neutrosophic Graphs
, 2022 In this book, some notions are introduced about “Zero Forcing Number in Neutrosophic Graphs.” Three chapters are devised as “Common Notions”, “Modified Notions” and “Extended Notions”. Three manuscripts are cited as the references of these chapters which
Henry Garrett
core +1 more source
Expected propagation time for probabilistic zero forcing [PDF]
, 2022 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
0047 | Zero Forcing Number in Neutrosophic Graphs
, 2022 New setting is introduced to study zero forcing number and zero forcing neutrosophic-number. Leaf-like is a key term to have these notions. Let NTG : (V,E,σ,μ) be a neutrosophic graph. Then zero forcing number Z(NTG) for a neutrosophic graph NTG : (V,E,σ,
Henry Garrett
core +1 more source
The Forcing Domination Number of Hamiltonian Cubic Graphs [PDF]
, 2009 The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination number for those ...
H. Abdollahzadeh Ahangar +3 more
core +1 more source
Line graphs: their maximum nullities and zero forcing numbers [PDF]
, 2008 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
Metric dimension and zero forcing number of two families of line graphs [PDF]
, 2012 summary:Zero forcing number has recently become an interesting graph parameter studied in its own right since its introduction by the “AIM Minimum Rank–Special Graphs Work Group”, whereas metric dimension is a well-known graph parameter.
Cong X. Kang +5 more
core +1 more source
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
Linear non-normal energy amplification of harmonic and stochastic forcing in turbulent channel flow [PDF]
, 2010 The linear response to stochastic and optimal harmonic forcing of small coherent perturbations to the turbulent channel mean flow is computed for Reynolds numbers ranging from Re_tau=500 to Re_tau=20000.
Hwang, Yongyun +3 more
core +1 more source
Computing the Zero Forcing Number for Generalized Petersen Graphs [PDF]
, 2020 Let G be a simple undirected graph with each vertex colored either white or black, u be a black vertex of G, and exactly one neighbor v of u be white. Then change the color of v to black. When this rule is applied, we say u forces v, and write u ® v .
Maryam TAVAKKOLI +5 more
core +1 more source