A Radio Even Geometric Mean Graceful Labeling of a connected graph G is a bijection µ:V(G) → {2, 4, 6, …, 2|V|} satisfying the condition ????(????, ????) + ⌈√????(????)????(????)⌉ ≥ 1 + ????????????????(????) for every ????, ???? ∈ ????(????). A graph which admits radio even geometric mean graceful labeling is called a radio even geometric mean graceful graph. In this paper, we introduce the radio even geometric mean graceful labeling on degree splitting of snake related graphs.