More Results on Complementary Tree Domination Number of Graphs
![](https://ojsdergi.com/ojsicons/gor.png)
![](https://ojsdergi.com/ojsicons/pdf.png)
Keywords:
Domination number, graphAbstract
A set $D$ of a graph $G = (V, E)$ is a dominating set if every vertex in $V-D$ is adjacent to some vertex in $D$. The domination number $\gamma(G)$ is the minimum cardinality of a dominating set. A dominating set $D$ is called a complementary tree dominating set if the induced subgraph $ $ is a tree. The minimum cardinality of a complementary tree dominating set is called the complementary tree domination number of $G$ and is denoted by $\gamma_{ctd}(G)$. In this paper, some results on complementary tree domination established.
Downloads
Published
How to Cite
Issue
Section
License
![Creative Commons License](http://i.creativecommons.org/l/by-nc/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.