Results 271 to 280 of about 9,977,087 (284)
Some of the next articles are maybe not open access.
Reconfiguration Graphs of Zero Forcing Sets
Discrete Applied Mathematics, 2023Leslie Hogben +2 more
exaly
The zero forcing number of P(n,3)
In Theorem 3.6, Rashidi, Shajareh Poursalavati and Tavakkoli write that Z(P(n,3)) = 8 for all n at least 12. Krishnan found that this statement is false for n = 12, where Z(P(12,3)) = 7, calculated Z(P(n,3)) exhaustively for n from 7 to 20, and conjectured that Z(P(n,3)) = 8 for every n at least 13.openaire +1 more source
On the zero forcing number of graphs and their splitting graphs
2019Summary: In [10], the notion of the splitting graph of a graph was introduced. In this paper we compute the zero forcing number of the splitting graph of a graph and also obtain some bounds besides finding the exact value of this parameter. We prove for any connected graph \(\Gamma\) of order \(n \geqslant 2\), \(Z[S(\Gamma)]\leqslant 2 Z(\Gamma)\) and
Chacko, B. +2 more
openaire +2 more sources
Computational Approaches for Zero Forcing and Related Problems
European Journal of Operational Research, 2019Illya V. Hicks +2 more
exaly
Effects of Vertex Degrees on the Zero-Forcing Number and Propagation Time of a Graph
Discrete Applied Mathematics, 2018Illya V. Hicks, Caleb C Fast
exaly
On the Zero Forcing Number of Complementary Prism Graphs
2023DOMINIC, CHARLES, RAKSHA, M R
openaire +1 more source
The Zero Forcing Polynomial of a Graph
Discrete Applied Mathematics, 2019Sean Joseph English +2 more
exaly
Propagation Time for Zero Forcing on a Graph
Discrete Applied Mathematics, 2012Sarah Meyer +2 more
exaly
Zero Forcing and Maximum Nullity for Hypergraphs
Discrete Applied Mathematics, 2020Leslie Hogben
exaly
Complexity and Computation of Connected Zero Forcing
Discrete Applied Mathematics, 2017Illya V. Hicks, Boris Brimkov
exaly