Domination and paired domination in Turiyam graphs with application

Abstract

A potent tool in the theory of graphs, the Neutrosophic graph, is used to describe the variety of real-world cases with uncertainty brought on by ambiguous, inconsistent, and unpredictable data. In order to handle unpredictability in data sets larger than the current true, false, and not exactly known zones, the Turiyam graph was recently introduced. In both theoretical and applied graph theory environments, the ideas of domination and paired domination are crucial. For this reason, the current study introduces the ideas of domination and paired domination in Turiyam graphs together with the characteristics of each concept. Furthermore, domination in complete bipartite graphs, strong paired domination, and the application of paired domination are all worked out.