Classification of Efficient Total Domination Sets of Circulant Graphs of Degree 5
Keyword(s):
An efficient total dominating set D of a graph G is a vertex subset such that every vertex of G has exactly one neighbor in the set D. In this paper, we give necessary and sufficient conditions for the existence of efficient total domination sets of circulant graphs whose degree is 5 and classify these sets.
2003 ◽
Vol 35
(04)
◽
pp. 1111-1130
◽
2004 ◽
Vol 134
(6)
◽
pp. 1177-1197
◽
2020 ◽
Vol ahead-of-print
(ahead-of-print)
◽
2009 ◽
Vol 29
(2)
◽
pp. 715-731
◽
2003 ◽
Vol 35
(4)
◽
pp. 1111-1130
◽