Tadpole domination number of graphs.

The graph obtained by joining cycle C m to a path P n with a bridge is called Tadpole graph denoted by T m , n . A subset D of V (G) is said to be a tadpole dominating set of G if D is a dominating set and the set of vertices of D spans a tadpole graph T m , n where m ≥ 3 , n ≥ 1. In this paper, we find the tadpole domination number of cartesian product of certain graphs, namely, paths, cycles and complete graphs. Also the tadpole domination number for the Mycielskian of cycles and paths is obtained. [ABSTRACT FROM AUTHOR]