Construction of (γ, k)-critical graphs
Michitaka Furuya · Australas. J Comb. · 2012
For a graph G, we let γ(G) denote the domination number of G .A graph G is said to be (l, k)-critical if γ(G )= l and γ(G − U ) γ (G) + 1 is possible for some graphs G and vertices v ∈ V (G), it is always the case that γ(G−v) ≥ γ(G)−1, that is, deleting a vertex can decrease the domination number by at most one. In 1988, Brigham, Chinn and Dutton [4] began the study of graphs for which γ(G − v )= γ(G) − 1