Classification of Efficient Total Domination Sets of Circulant Graphs of Degree 5
An efficient total dominating set <i>D</i> of a graph <i>G</i> is a vertex subset such that every vertex of <i>G</i> has exactly one neighbor in the set <i>D</i>. In this paper, we give necessary and sufficient conditions for the existence of efficient...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-11-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/12/12/1944 |