Degree Partition Number of Some Derived Graphs.

Saved in:

Bibliographic Details
Title:	Degree Partition Number of Some Derived Graphs.
Authors:	Malathi, N.¹ rmnmalathi96@gmail.com, Bhuvaneshwari, M.² bhuvanaresearch2020@gmail.com, Avadayappan, Selvam³ selvam_avadayappan@yahoo.co.in
Source:	IAENG International Journal of Applied Mathematics. Jun2025, Vol. 55 Issue 6, p1865-1872. 8p.
Subjects:	Individual needs, Mathematicians
Abstract:	In many places, there may emerge a situation in which a certain group of individuals or components need to be partitioned into many groups in order to meet certain requirements. To investigate the characteristics and nature of a network, our mathematicians create a variety of partitioning techniques. Usage of graph theoretical method simplifies the partitioning procedure. On the vertex set of graph G, we define a partition πκ consisting of k partition classes. πκ is said to be a similar degree partition of G if the absolute difference of the sum of the degrees of all vertices between any two partition classes is at most 1. The largest value k across all the similar degree partition of the graph G is defined to be the degree partition number of G and is denoted by ψD(G). This partition suits the need for partitioning any resource into groups of almost equal strength. In this paper we have established some interesting facts and theorems regarding the degree partition number of some derived graphs. [ABSTRACT FROM AUTHOR]
	Copyright of IAENG International Journal of Applied Mathematics is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	In many places, there may emerge a situation in which a certain group of individuals or components need to be partitioned into many groups in order to meet certain requirements. To investigate the characteristics and nature of a network, our mathematicians create a variety of partitioning techniques. Usage of graph theoretical method simplifies the partitioning procedure. On the vertex set of graph G, we define a partition πκ consisting of k partition classes. πκ is said to be a similar degree partition of G if the absolute difference of the sum of the degrees of all vertices between any two partition classes is at most 1. The largest value k across all the similar degree partition of the graph G is defined to be the degree partition number of G and is denoted by ψD(G). This partition suits the need for partitioning any resource into groups of almost equal strength. In this paper we have established some interesting facts and theorems regarding the degree partition number of some derived graphs. [ABSTRACT FROM AUTHOR]
ISSN:	19929978