bounds for domination parameters in cayley graphs on dihedral group为控制参数范围在凯莱图反组.pdfVIP

Open Journal of Discrete Mathematics, 2012, 2, 5-10 /10.4236/ojdm.2012.21002 Published Online January 2012 (http://www.SciRP.org/journal/ojdm) Bounds for Domination Parameters in Cayley Graphs on Dihedral Group T. Tamizh Chelvam, G. Kalaimurugan Department of Mathematics, Manonmaniam Sundaranar University, Tirunelveli, India Email: tamche59@ Received November 3, 2011; revised December 18, 2011; accepted December 25, 2011 ABSTRACT In this paper, sharp upper bounds for the domination number, total domination number and connected domination number for the Cayley graph G = Cay(D2n, Ω) constructed on the finite dihedral group D2n, and a specified generating set Ω of D2n . Further efficient dominating sets in G = Cay(D2n, Ω) are also obtained. More specifically, it is proved that some of the proper subgroups of D2n are efficient domination sets. Using this, an E-chain of Cayley graphs on the dihe- dral group is also constructed. Keywords: Cayley Graph; Dihedral Group; Domination; Total Domination; Connected Domination; Efficient Domination 1. Introduction and Notation of S or adjacent to an element of S. A dominating set S is a minimal dominating set if no proper subset of S is a Design of interconnection networks is an important inte- dominating set. The domination number (G) of a graph gral part of any parallel processing of distributed system. G