Tadpole Domination in Graphs
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 introdu...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Baghdad, College of Science for Women
2018-12-01
|
| Series: | مجلة بغداد للعلوم |
| Subjects: | |
| Online Access: | http://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/43 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 2078-8665 2411-7986 |