Tadpole Domination in Graphs

Authors

M. N. Al-Harere
P. A. Khuda Bakhash

Abstract

A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.

Keywords

Dominating set, Tadpole graph, Tadpole domination number. Mathematical subject classification: 05C69.

Article Type

Article

How to Cite this Article

Al-Harere, M. N. and Bakhash, P. A. Khuda (2018) "Tadpole Domination in Graphs," Baghdad Science Journal: Vol. 15: Iss. 4, Article 13.
DOI: https://doi.org/10.21123/bsj.2018.15.4.0466