A domatic partition of a graph G = (V, E) is a partition of V into disjoint sets V1, V2,..., VK such that each Vi is a dominating set for G. A subdivision of a graph G is a graph resulting from the subdivision of edges in G. In this paper we define domatic subdivision stable graph and initiate a study on them. © Research India Publications.