Abstract

Cayley graphs are graphs constructed out of a finite group Γ and its generating set A. 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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call