A Square Difference Geometric Mean (SDGM) 3-Equitable labeling of a graph \(G=(V,E)\) is a mapping \(f:V(G)\rightarrow \{0,1,2\}\) such that the induced mapping \(g:E(G)\rightarrow \{0,1,2\}\) is defined by \(\lceil \sqrt {|(f(u))^{2}-(f(v))^{2}|}\rceil \) , \(\forall uv \in E(G)\) with the condition \(|v_{f}(i)-v_f (j)|\leq 1\) and \(|e_{g}(i)-e_g (j)|\leq 1\) for all \(0\leq i\) , \(j\leq 2\) . Also, if \(|(v_f+e_g)(i)-(v_f+e_g)(j)|\leq 1\) for all \(0\leq i\) , \(j\leq 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 prove the following cycle-related graphs: crown graph, gear graph, triangular cycle graph, and wheel graph are the SDGM 3-equitable graph or perfect SDGM 3-equitable graph.