Subgroups as efficient dominating sets in Cayley graphs

被引：25

作者：

Chelvam, T. Tamizh ^{[1
]}

Mutharasu, Sivagnanam ^{[1
]}

机构：

[1] Manonmaniam Sundaranar Univ, Dept Math, Tirunelveli 627012, Tamil Nadu, India

来源：

DISCRETE APPLIED MATHEMATICS | 2013年 / 161卷 / 09期

关键词：

Circulant graphs; Domination number; Dominating sets; Efficient dominating sets;

D O I：

10.1016/j.dam.2012.09.005

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Cayley graphs are graphs constructed out of a finite group Gamma and its generating set A. Circulant graphs are Cayley graphs corresponding to finite cyclic groups. In this paper, the value of the domination number for some circulant graphs is obtained and a corresponding dominating set is also determined. At last a necessary and sufficient condition for a subgroup to be an efficient dominating set in circulant graphs is also obtained. (c) 2012 Elsevier B.V. All rights reserved.

引用

页码：1187 / 1190

页数：4

共 8 条

[1] DOMINATING SETS IN CAYLEY GRAPHS ON Z(n) [J].

Chelvam, T. Tamizh ;

Rani, I. .

TAMKANG JOURNAL OF MATHEMATICS, 2007, 38 (04) :341-345

[2] Efficient dominating sets in Cayley graphs [J].

Dejter, IJ ;

Serra, O .

DISCRETE APPLIED MATHEMATICS, 2003, 129 (2-3) :319-328

[3]

Haynes T.W., 2000, FUNDAMENTALS DOMINAT

[4] The bondage numbers and efficient dominations of vertex-transitive graphs [J].

Huang, Jia ;

Xu, Jun-Ming .

DISCRETE MATHEMATICS, 2008, 308 (04) :571-582

[5] Ring, torus and hypercube architectures/algorithms for parallel computing [J].

Lakshmivarahan, S ;

Dhall, SK .

PARALLEL COMPUTING, 1999, 25 (13-14) :1877-1906

[6] Independent perfect domination sets in Cayley graphs [J].

Lee, J .

JOURNAL OF GRAPH THEORY, 2001, 37 (04) :213-219

[7] Efficient domination in circulant graphs with two chord lengths [J].

Obradovic, Nenad ;

Peters, Joseph ;

Ruzic, Goran .

INFORMATION PROCESSING LETTERS, 2007, 102 (06) :253-258

[8]

TamizhChelvam T., 2009, J COMBIN MATH COMBIN, V69, P251

← 1 →