Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Iteration Index of a Zero Forcing Set in a Graph   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.

36
The categories of this paper are: cmp-lg
24
The categories of this paper are: dg-ga
4
The categories of this paper are: cond-mat
16
The categories of this paper are: stat
25
The categories of this paper are: patt-sol
15
The categories of this paper are: nucl-ex
7
The categories of this paper are: hep-th
32
The categories of this paper are: atom-ph
22
The categories of this paper are: chao-dyn
23
The categories of this paper are: solv-int
10
The categories of this paper are: q-bio
28
The categories of this paper are: alg-geom
6
The categories of this paper are: astro-ph
26
The categories of this paper are: bayes-an
9
The categories of this paper are: nlin
14
The categories of this paper are: math-ph