文章基本信息

标题：Domination in Cayley graphs: A survey
本地全文：下载
作者：T. Tamizh Chelvam ; M. Sivagami
期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2019
卷号：16
期号：1
页码：27-40
DOI：10.1016/j.akcej.2017.11.005
语种：English
出版社：Elsevier
摘要：AbstractLetΩbe a symmetric generating set of a finite groupΓ. Assume that(Γ,Ω)be such thatΓ=〈Ω〉andΩsatisfies the two conditionsC1: the identity elemente∉ΩandC2: ifa∈Ω, thena−1∈Ω.Given(Γ,Ω)satisfyingC1andC2,define aCayley graphG=Cay(Γ,Ω)withV(G)=ΓandE(G)={(x,y)a|x,y∈Γ,a∈Ωandy=xa}. WhenΓ=Zn=〈Ω〉, it is called ascirculant graphand denoted byCir(n,Ω). In this paper, we give a survey about the results on dominating sets in Cayley graphs and circulant graphs.
关键词：KeywordsCayley graphUnitary Cayley graphDominating setsEfficient dominating setsE-Chain