• N. Malathi
• M. Bhuvaneshwari
• Selvam Avadayappan

In pandemic period, there is a need to execute any system with partitioned labours in which every class in a partition shares more or less same potential. Let π_k={V_1,V_2,…,V_k} be a partition of vertex set V of a graph G. Then π_k is called similar degree partition if the sum of degrees of vertices in each class V_i,1≤i≤k, differs from that of other by at most 1. The degree partition number of G, ψ_D (G)=max⁡{k/π_k is a similar degree partition of G} or 1 if no such π_k exists. In this paper, we initiate the study on this parameter and prove some interesting facts.

Partitioning, Degree Partition number, Degree partitioning.

"A Note on Degree Partition Number of a Graph", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.8, Issue 7, page no.a717-a722, July-2021, Available :http://www.jetir.org/papers/JETIR2107091.pdf

"A Note on Degree Partition Number of a Graph", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.8, Issue 7, page no. ppa717-a722, July-2021, Available at : http://www.jetir.org/papers/JETIR2107091.pdf