Domination in Cayley graphs: A survey

Domination in Cayley graphs: A survey

Show other versions (1)

Let be a symmetric generating set of a finite group . Assume that be such that and satisfies the two conditions : the identity element and : if , then Given satisfying and define a Cayley graph with and . When , it is called as circulant graph and denoted by . In this paper, we give a survey about t...

Full description

Bibliographic Details
Main Authors: T. Tamizh Chelvam, M. Sivagami
Format: Article
Language:English
Published: Taylor & Francis Group 2019-04-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
cayley graph
unitary cayley graph
dominating sets
efficient dominating sets
e-chain
Online Access:http://dx.doi.org/10.1016/j.akcej.2017.11.005
Description
Summary:Let be a symmetric generating set of a finite group . Assume that be such that and satisfies the two conditions : the identity element and : if , then Given satisfying and define a Cayley graph with and . When , it is called as circulant graph and denoted by . In this paper, we give a survey about the results on dominating sets in Cayley graphs and circulant graphs.
ISSN:0972-8600

Similar Items