Author:
Chelvam T. Tamizh,Rani I.
Abstract
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 $.
Publisher
Tamkang Journal of Mathematics
Subject
Applied Mathematics,General Mathematics
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Characterizing Finite Groups through Equitable Graphs: A Graph-Theoretic Approach;Mathematics;2024-07-06
2. Dominator and total dominator coloring of circulant graph Cn(1, 2);Journal of Discrete Mathematical Sciences and Cryptography;2021-05-26
3. The cubic power graph of finite abelian groups;AKCE International Journal of Graphs and Combinatorics;2021-01-02
4. Independent Perfect Domination Sets in Semi-Cayley Graphs;Algorithmic Aspects in Information and Management;2020
5. Domination in Cayley graphs: A survey;AKCE International Journal of Graphs and Combinatorics;2019-04-01