Pendant Domination in Some Generalised Graphs

Let be any graph. A dominating set in is called a pendant dominating set if contains at least one pendant vertex. The least cardinality of the pendant dominating set in is called the pendant domination number of , denoted by . In this paper we study the pendant domination number for crown graph, Banana tree graph, helm graph, cocktail party graph, stacked book graph, octahedral graph and Jahangir graph.