Abstract
The graph obtained by joining cycle [Formula: see text] to a path [Formula: see text] with a bridge is called Tadpole graph denoted by [Formula: see text]. A subset [Formula: see text] of [Formula: see text] is said to be a tadpole dominating set of [Formula: see text] if [Formula: see text] is a dominating set and the set of vertices of [Formula: see text] spans a tadpole graph [Formula: see text] where [Formula: see text], [Formula: see text]. 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
