A Square Difference Geometric Mean (SDGM) 3-Equitable labeling of a graph G=(V,E) is a mapping f:V(G)→{0,1,2} such that the induced mapping g:E(G)→{0,1,2} is defined by ⌈√(|〖(f(u))〗^2-〖(f(v))〗^2 | ) ⌉,∀ uv∈E(G) with the condition |v_f (i)-v_f (j)|≤1 and |e_g (i)-e_g (j)|≤1 for all 0≤i,j≤2. Also, if |〖(v〗_f+e_g)(i)-(v_f+e_g)(j)|≤1 for all 0≤i,j≤2 then the labeling is called perfect square difference geometric mean 3-equitable labeling. A graph is called a square difference geometric mean (SDGM) 3-Equitable graph if there exists a SDGM 3-equitable labeling and perfect square difference geometric mean 3-equitable graph if there exists a Perfect SDGM 3-Equitable labeling. In this paper we investigate the SDGM 3-Equitable labeling or Perfect SDGM 3-Equitable labeling of certain cycle related graphs such as alternate triangular cycle graph, flower graph and petersen graph