The Regular Pendant Domination Number of Some Special Graphs

Abstract

This article aims to explore the concept of regular pendant domination across various distinct
graph types, including complete graphs, path graphs, cycle graphs, lollipop graphs, barbell graphs, bistar
graphs, Petersen graphs, fan graphs, cone graphs, helm graphs, windmill graphs and complete bipartite graphs.
Additionally, we examine regular domination in relation to specic graph operations, such as the join and the
corona product of two graphs.