Search

Finding a group of dominant servers is a necessary step towards optimising service provisioning to all clients in the complex world of server-client networks. This crucial decision rests on the non-split dominance number in the graph architecture. We present the idea of an equitable non-split domination number in graphs to address the possible problem of unequal task distribution among servers. When the vertices of a dominating set, Dens, have the same colour in an equitable colouring scheme, the set is said to be equitable. The induced subgraph V - D also maintains its connectivity. In particular, the application of equitable non-split domination numbers to graphs like the Triangular Grid, Antiprism, Wheel, and Complete Graphs is explored in this study. [ABSTRACT FROM AUTHOR]