In this paper, we investigate a MATLAB program to demonstrate the behavior of wheel graphs under sum 3-equitable labeling. A vertex labeling ζ of a graph W, defined as a bijection from the vertex set V(W) to the set {0, 1, 2…., m−1}, induces an edge labeling ζ*given by:ζ * (qr) = {0 if ζ(q) + ζ(r) ≡ 0(mod3) 1 if ζ(q) + ζ(r) ≡ 1(mod3) 2 if ζ(q) + z(r) ≡ 2(mod3)and |eζ (l) – eζ (k)| ≤ 1 for all 0 ≤ l, k ≤ 2. A graph which preserves sum 3-equitable labeling is called a sum 3- equitable graph.