Bounds for Domination Parameters in Cayley Graphs on Dihedral Group英文文献资料.docVIP

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 dominating set. The domination number ?(G) of a graph G is the minimum cardinality of a dominating set in G and the corresponding dominating set is called a ?-set. A set S ? V is called a total dominating set if every vertex v ? V is adjacent to an element u (?v) of S. The total domination number ?t(G) equals the minimum cardinality among all the total dominating sets in G and the corre- sponding total dominating set is called a ?t-set. A domi- nating set S is called a connected dominating set if the induced subgraph ?S? is connected. The connected domi- nation number ?c(G) of a graph G equals the minimum cardinality of a connected dominating set in G and a cor- responding connected dominating set is called a ?c-set. A set S ?