For any graph G(V, ( V, E ), V ( G ) is the vertex set and E ( G ) is the edge set. Let the vertex coloring be called modular coloring m c (G) G ) of G if any two adjacent vertices receive different color sums, that is, S ( u ) not equal S ( v ) for u, v is an element of E ( G ) here S ( u ) = & sum;v v is an element of N ( u ) C ( v ij ). 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.