Efficient open domination in Cayley graphs

被引：21

作者：

Chelvam, T. Tamizh ^{[1
]}

Mutharasu, Sivagnanam ^{[2
]}

机构：

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

[2] Sri Krishna Coll Engn & Technol, Dept Sci & Humanities, Coimbatore 641008, Tamil Nadu, India

来源：

APPLIED MATHEMATICS LETTERS | 2012年 / 25卷 / 10期

关键词：

Cayley graphs; Harary graphs; Efficient open domination; Covering projection; SETS;

D O I：

10.1016/j.aml.2011.12.036

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Efficient open dominating sets in bipartite Cayley graphs are characterized in terms of covering projections. Necessary and sufficient conditions for the existence of efficient open dominating sets in certain circulant Harary graphs are given. Chains of efficient dominating sets, and of efficient open dominating sets, in families of circulant graphs are described as an application. (C) 2012 Elsevier Ltd. All rights reserved.

引用

页码：1560 / 1564

页数：5

共 9 条

[1]

Chellali M., 2004, AKCE Int. J. Graphs Comb, V1, P69

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

Chelvam, T. Tamizh ;

Rani, I. .

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

[3]

Chelvam Tamizh, 2010, Advanced Studies in Contemporary Mathematics, V20, P57

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

Dejter, IJ ;

Serra, O .

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

[5]

Haynes T.W., 2000, FUNDAMENTALS DOMINAT

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

Huang, Jia ;

Xu, Jun-Ming .

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

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

Lee, J .

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

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

Obradovic, Nenad ;

Peters, Joseph ;

Ruzic, Goran .

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

[9]

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

← 1 →