Edge Domination in Signed Graphs

Main Article Content

K. Prabhavathi , R Santhi, P Revathy


A signed graph is defined by an ordered pair   where   is an underlying graph of  and   is a function called a signature function. In this paper we define the edge domination parameters like positive edge domination number and negative edge domination number in signed graph. Further investigate the properties and bound of these domination parameters. In addition explain the theorem with examples.


Article Details