Study of Some Graph Operators in Domination Theory

Pages: 14-18

Satish P. Hande, Geeta Kameri, Vijay V. Teli

Abstract

Graph theory is a fundamental area of discrete mathematics with vast applications in network analysis, computer science, biology, and social sciences. Within this field, domination theory is a critical concept that deals with the selection of a set of vertices such that every vertex in the graph is either in the set or adjacent to a vertex in the set. This paper explores the impact and interaction of various graph operators on domination parameters such as domination number, total domination, independent domination, and power domination. Through examples and theoretical exploration, we analyze how certain graph operations like the complement, line graph, Cartesian product, corona, and join affect domination- related properties.