Zero forcing number of degree splitting graphs and complete degree splitting graphs

A subset ℤ ⊆ V(G) of initially colored black vertices of a graph G is known as a zero forcing set if we can alter the color of all vertices in G as black by iteratively applying the subsequent color change condition. At each step, any black colored vertex has exactly one white neighbor, then change the color of this white vertex as black. The zero forcing number ℤ (G), is the minimum number of vertices in a zero forcing set ℤ of G (see [11]). In this paper, we compute the zero forcing number of the degree splitting graph (-Graph) and the complete degree splitting graph (-Graph) of a graph. We prove that for any simple graph, ℤ [(G)] k + t, where ℤ (G) = k and t is the number of newly introduced vertices in (G) to construct it