Abstract:
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 of order n > 2, Z[S()] 6 2Z() and also obtain
many classes of graph in which Z[S()] = 2Z(). Further, we show
some classes of graphs in which Z[S()] < 2Z().
Description:
Chacko B. On the zero forcing number of graphs and their splitting graphs / B. Chacko, Ch. Dominic, K. P. Premodkumar // Algebra and Discrete Mathematics. - 2019. - Vol. 28. - Number 1. - Рp.29-43
