A Note on Connected Interior Domination in Join and Corona of Two Graphs
Leomarich Fortugaliza Casinillo · IOSR Journal of Mathematics · 2017
Let be a non-complete connected graph of order greater or equal to 3 with vertex set and edge set .An interior dominating set of is called a connected interior dominating set of if the subgraphs induced by is connected.The minimum cardinality of a connected interior dominating set of , denoted by , is called the connected interior domination number.A connected interior dominating set of cardinality is called a of .In this note, we revisit these concepts for some special graphs.Further, we characterize the connected interior dominating sets in the join and corona of two graphs and give some important results.