A vertex set S is called a power dominating set of a graph G if every vertex within the system is monitored by the set S following a collection of rules for power grid monitoring. The power domination number of G is the order of a minimal power dominating set of G. In this paper, we solve the power domination number for splitting and degree splitting graph.