Matching of 5-γ-critical leafless graph with a cut edge

Given a graph G=(V,E), a subset S of V is a dominating set of G if every vertex in V∖S is adjacent to a vertex in S. The minimum cardinality of a dominating set in a graph G is called the domination number of G and is denoted by γ(G). A graph G is said to be k-γ-critical if γ(G)=k, but γ(G+e)