Tadpole Domination in Graphs

Main Article Content

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.

Article Details

How to Cite
1.
Tadpole Domination in Graphs. Baghdad Sci.J [Internet]. 2018 Dec. 9 [cited 2024 Mar. 28];15(4):0466. Available from: https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/43
Section
article

How to Cite

1.
Tadpole Domination in Graphs. Baghdad Sci.J [Internet]. 2018 Dec. 9 [cited 2024 Mar. 28];15(4):0466. Available from: https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/43

Similar Articles

You may also start an advanced similarity search for this article.