Study Of Signed Edge Domination Number Of Graphs

The. signed domination number of a graph has its important and applyication background. It is known that computing signed edge domination number of graphs is NP-complete problems, so it is meaningful.In this paper, we discuss five kinds of signed edge domination, that are signed edge domination, signed clique edge domination, inverse signed edge total domination, signed star domination, inverse signed edge total domination, reverse signed edge k domination.In the second chapter, we determine the signed edge domination numbers of graph Fn+1*, Hn and Pn*.In the third chapter, we determine the signed clique edge domination numbers of graph Pi∨Kn-i(n>i>0), Ci∨Kn-i(n>i≥3),Kn∨Pm and Kn∨Cm.In the fourth chapter, we obtain two upper bounds of inverse signed edge total domination number of graphs, and obtained the upper and lower bounds of the inverse signed edge total domination number of generalized Petersen graphs. In the fifth chapter, we determinate the signed star domination number of the generalized Petersen graphs. In the sixth chapter, we give some new upper bounds of the reverse signed edge k-domination number of general graphs.