Efficient Domination in Bi-Cayley Graphs (Report‪)‬

[section]1. Introduction The terminology and notation in this paper follows that found in [3]. The fact that Cayley graphs are excellent models for interconnection networks, investigated in connection with parallel processing and distributed computation. The concept of domination for Cayley graphs has been studied by various authors and one can refer to [2, 4, 6]. I.J. Dejter, O. Serra [2], J.Huang, J-M. Xu [4] obtained some results on efficient dominating sets for Cayley graphs. The existence of independent perfect dominating sets in Cayley graphs was studied by J.Lee [6]. Tamizh Chelvam and Rani [8-10], obtained the domination, independent domination, total domination and connected domination numbers for some Cayley graphs constructed on [Z.sub.n] for some generating set of [Z.sub.n].