Iteration Index of a Zero Forcing Set in a Graph

Details Iteration Index of a Zero Forcing Set in a Graph Iteration Index of a Zero Forcing Set in a Graph

2011-05-08

arxiv.org/abs/1105.1492v1

Bull. Inst. Combin. Appl. Vol. 64 (2012) pp. 57-72

Mathematics

Combinatorics

13 pages, 12 figures

Scientific paper

Let each vertex of a graph G = (V(G), E(G)) be given one of two colors, say, "black" and "white". Let Z denote the (initial) set of black vertices of G. The color-change rule converts the color of a vertex from white to black if the white vertex is the only white neighbor of a black vertex. The set Z is said to be a zero forcing set of G if all vertices of G will be turned black after finitely many applications of the color-change rule. The zero forcing number of G is the minimum of |Z| over all zero forcing sets Z \subseteq V (G). Zero forcing parameters have been studied and applied to the minimum rank problem for graphs in numerous articles. We define the iteration index of a zero forcing set of a graph G to be the number of (global) applications of the color-change rule required to turn all vertices of G black; this leads to a new graph invariant, the iteration index of G - it is the minimum of iteration indices of all minimum zero forcing sets of G. We present some basic properties of the iteration index and discuss some preliminary results on certain graphs.

Affiliated with

Also associated with

No associations

Rating

Iteration Index of a Zero Forcing Set in a Graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Iteration Index of a Zero Forcing Set in a Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Iteration Index of a Zero Forcing Set in a Graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-144982