Preferred Language
Articles
/
bsj-43
Tadpole Domination in Graphs
...Show More Authors

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.

Scopus Clarivate Crossref
View Publication Preview PDF
Quick Preview PDF