Pendant Domination in Some Generalised GraphsJournal: International Journal of Scientific Engineering and Science (Vol.1, No. 7)
Publication Date: 2017-08-15
Authors : Nayaka S.R.; Puttaswamy; Purushothama S.;
Page : 13-15
Keywords : Dominating set; Pendant dominating set; Pendant domination number;
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.
Other Latest Articles
Last modified: 2017-09-07 23:09:47