On connected (γ, k)-critical graphs.
Doost Ali Mojdeh, P.Y. Firoozi, Roslan Hasni · Australas. J Comb. · 2010
A graph G is said to be (γ, k)-critical if γ(G−S) < γ(G) for any set S of k vertices and domination number γ. Properties of (γ, k)-critical graphs are studied for k ≥ 3. Ways of constructing a (γ, k)-critical graph from smaller (γ, k)-critical graphs are presented.