For any graph G(V, E), V(G) is the vertex set and E(G) is the edge set. Let the vertex coloring be called modular coloring mc (G) of G if any two adjacent vertices receive different color sums, that is, S(u) ≠ S(v) for  u, v ∈ E(G) here S(u) = ∑v ∈ N(u)C(vij). In this paper, the structural properties of an inflated tree-related graph were discussed, and in addition, the modular chromatic number for the same was determined.