Computational Complexity of Outer-Independent Total and Total Roman Domination Numbers in Trees
An outer-independent total dominating set (OITDS) of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V (G) \ D is independent. The outer-independent total domination number of a graph G, denoted by γ<sub>oit</sub>(G), is the m...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2018-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8401493/ |