Several Kinds Of Special Signed Domination Of Graphs

In this paper we do further research on the several kinds of special signed domination of graphs, on the vertex domination problem, we focus on signed total domination and its conception, and introduce the conception of reverse signed total domination; on the edge domination problem, we mainly survey signed edged domination and minus edge k dominating. first, we research and summarize mainly on the concept and charact of vertex signed total dominating function and the reverse signed total dominating function, and discuss the bounds on domination number for general graphs, also determined the exact values of domination number for the other special graphs.then, we research and summarize mainly on the concept and charact of edge signed dominating function and minus edge k dominating function, and discuss the bounds on domination number for general graphs, determined the exact values of domination number for one kind of special graphs.