Provide an example of a connected graph G for which γ(G)=γo​(G)=k for each integer k≥2, and provide a proof for n>k≥2.