In this paper we are going to analyse the graph theoretic approach to task partitioning and load balancing through weighted graph that improve the efficiency of the network. Good partitioning and balancing of nodes of weighted graph make the whole system more reliable and improves user satisfaction. Here we present a greedy graph algorithm to task partitioning and balancing of a weighted graph. A large weighted graph can be partitioned into small cluster in such a way that it is balanced.