On local reverse signed edge domination in graphs

In this paper we introduce the concept of local reverse signed edge domination in graphs. For a graph G, the concepts of local reverse signed edge domination function(LRSEDF) and local reverse signed edge domination number(LRSEDN) are gived. At the sime time we obtain three upper bounds of LRSEDN for general graphs G.