Sequences of graphical invariants

For a given graphical invariant π, a sequence (a o , a 1 ,…, a n ) of positive integers is said to be π‐feasible if there exists a graph G with distinguished vertices ν 1 , ν 2 ,…, ν n such that π (G) = a o and π(G −ν 1 −ν 2 −…−ν i ) = a i for i = 1, 2,…, n . In this paper, we investigate π‐feasible sequences for the irredundance, domination, and independence numbers of a graph.