Classification of Efficient Total Domination Sets of Circulant Graphs of Degree 5

Abstract

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.

Keywords

• graphs
• efficient total domination sets
• circulant graphs