Abbreviated Journal Title
Let I(G) be a graphical invariant defined for any graph G. For several choices of I representing domination parameters, we characterize sequences of positive integers a(1),a(2),...,a(n) which have an associated sequence of graphs G(1),G(2),...,G(n) such that G(i) has i vertices, G(i) is an induced subgraph of G(i+1), and I(G(i)) = a(i).
"Domination sequences" (2000). Faculty Bibliography 2000s. 2447.