Edge Domination of an Involutory Addition Cayley Graph

Abstract

Graph theory is one of the most advanced branches of discrete mathematics with variety of applications to different branches of Science and Technology. For a positive integer , the involutory addition Cayley graph ,  is the graph whose vertex set is   and edge set , where  is the set of involutory elements of .By taking Involutory Addition Cayley Graphs  the author’s evaluated graph related Edge domination numbers and Total edge domination numbers. In this paper, Edge domination number, Total edge domination number of the Involutory addition cayley graphs  were discussed.