Author:
Soo Kwon Young Soo,Young Sohn Moo Young
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.
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference12 articles.
1. Fundamentals of Domination in Graphs;Haynes,1998
2. On a class of fixed-point-free graphs
3. Efficient dominating sets in Cayley graphs
4. Efficient domination in circulant graphs
5. Efficient open domination in graphs;Gavlas;Sci. Ser. A Math. Sci.,2003
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献