Results 11 to 20 of about 9,485,710 (280)
Spectral bounds for the zero forcing number of a graph [PDF]
Discussiones Mathematicae Graph TheoryLet $Z(G)$ be the zero forcing number of a simple connected graph $G$. In this paper, we study the relationship between the zero forcing number of a graph and its (normalized) Laplacian eigenvalues.
Hongzhang Chen, Jianxi Li, Shou-Jun Xu
doaj +3 more sources
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 +3 more sources
A Short Proof for a Lower Bound on the Zero Forcing Number
Discussiones Mathematicae Graph Theory, 2020 We provide a short proof of a conjecture of Davila and Kenter concerning a lower bound on the zero forcing number Z(G) of a graph G. More specifically, we show that Z(G) ≥ (g − 2)(δ − 2) + 2 for every graph G of girth g at least 3 and minimum degree δ at
Fürst Maximilian, Rautenbach Dieter
doaj +5 more sources
A lower bound on the zero forcing number [PDF]
Discrete Applied Mathematics, 2019 In this note, we study a dynamic vertex coloring for a graph G. In particular, one starts with a certain set of vertices black, and all other vertices white.
Kalinowski, Thomas +2 more
core +5 more sources
0048 | Failed Zero-Forcing Number in Neutrosophic Graphs
, 2022 New setting is introduced to study failed zero-forcing number and failed zero-forcing neutrosophic-number. Leaf-like is a key term to have these notions.
Henry Garrett
core +4 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 +3 more sources
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings
Special Matrices, 2014 The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced paths in the graph that cover all ...
Taklimi Fatemeh Alinaghipour +2 more
doaj +5 more sources
Minimum rank and zero forcing number for butterfly networks [PDF]
Journal of Combinatorial Optimization, 2019 Zero forcing is a graph propagation process introduced in quantum physics and theoretical computer science, and closely related to the minimum rank problem.
Kalinowski, Thomas +4 more
core +7 more sources
On the Zero Forcing Number of Bijection Graphs
, 2015 The zero forcing number of a graph is a graph parameter based on a color change process, which starts with a state, where all vertices are colored either black or white.
Shcherbak, Denys, +5 more
core +3 more sources
Zero forcing number, constrained matchings and strong structural controllability
Linear Algebra and its Applications, 2015 The zero forcing number is a graph invariant introduced to study the minimum rank of the graph. In 2008, Aazami proved the NP-hardness of computing the zero forcing number of a simple undirected graph.
Tréfois, Maguy, Delvenne, Jean-Charles
core +4 more sources