Dominating Sets in Cayley Graphs on Z(subscript n)

T. Tamizh Chelvam ； I. Rani

《Tamkang Journal of Mathematics》 38卷4期 (2007/12) Pp. 341-345

並列摘要

A Cayley graph is a graph constructed out of a group Γ and its generating set A. In this paper we attempt to find dominating sets in Cayley graphs constructed out of Z(subscript n). Actually we find the value of domination number for Cay (Z(subscript n), A) and a minimal dominating set when |A| is even and further we have proved that Cay (Z(subscript n), A) is excellent. We have also shown that Cay (Z(subscript n), A) is 2-excellent, when n=t (|A|+1) +1 for some integer t, t＞0.

並列關鍵字

Cayley graphs ； dominating sets ； excellent graphs