Independent perfect dominating sets in semi-Cayley graphs

2021 ◽  
Author(s):  
Xiaomeng Wang ◽  
Shou-Jun Xu ◽  
Xianyue Li
Keyword(s):  
Cayley Graphs ◽  
Dominating Sets

scholarly journals Efficient dominating sets in Cayley graphs

2003 ◽  
Vol 129 (2-3) ◽  
pp. 319-328 ◽  
Author(s):  
Italo J. Dejter ◽  
Oriol Serra
Keyword(s):  
Cayley Graphs ◽  
Dominating Sets

scholarly journals Dominating sets in Cayley graphs on $ Z_{n} $

2007 ◽  
Vol 38 (4) ◽  
pp. 341-345 ◽  
Author(s):  
T. Tamizh Chelvam ◽  
I. Rani
Keyword(s):  
Cayley Graph ◽  
Cayley Graphs ◽  
Dominating Set ◽  
Domination Number ◽  
Dominating Sets ◽  
Generating Set ◽  
Minimal Dominating Set

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

scholarly journals Clique Dominating Sets of Euler Totient Cayley Graphs

2013 ◽  
Vol 4 (6) ◽  
pp. 46-49 ◽  
Author(s):  
M. Manjuri M. Manjuri
Keyword(s):  
Cayley Graphs ◽  
Dominating Sets

scholarly journals Subgroups as efficient dominating sets in Cayley graphs

2013 ◽  
Vol 161 (9) ◽  
pp. 1187-1190 ◽  
Author(s):  
T. Tamizh Chelvam ◽  
Sivagnanam Mutharasu
Keyword(s):  
Cayley Graphs ◽  
Dominating Sets

Algorithms to Compute some Dominating Sets of ES (N, K) and ESC (N, K)

2014 ◽  
Vol 4 (1) ◽  
pp. 35
Author(s):  
Pious Missier ◽  
Anto Kinsley ◽  
Evangeline Prathibha Fernando
Keyword(s):  
Dominating Sets
Sign in / Sign up

Export Citation Format

Share Document