Article ID Journal Published Year Pages File Type
419719 Discrete Applied Mathematics 2013 4 Pages PDF
Abstract

Cayley graphs are graphs constructed out of a finite group ΓΓ and its generating set AA. Circulant graphs are Cayley graphs corresponding to finite cyclic groups. In this paper, the value of the domination number for some circulant graphs is obtained and a corresponding dominating set is also determined. At last a necessary and sufficient condition for a subgroup to be an efficient dominating set in circulant graphs is also obtained.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Subgroups as efficient dominating sets in Cayley graphs
Authors
, ,