فهرست نشریات علمی دسترسی آزاد ایران

Let G=(V,E) be a simple graph. A subset D⊆V(G) is called a dominating set if every vertex in V-D  is adjacent to at least one vertex in D. In this paper, we introduce a new concept of Isolate Pendant Dominating set (IPD-set) in graphs, and define a new domination parameter known as the isolate pendant domination number. We investigate this new parameter by determining the exact number of minimum IPD-sets for various standard and special graphs, as well as for graphs constructed through integrative operations involving path and wheel-related structures. We have established new characterizations, boundaries, and relationships for the isolate pendant domination number compared to the classical domination number. Our findings underscore the theoretical importance and potential practical applications within graph theory and its related areas.