On Signed Edge Total Domination Numbers of Graphs

In this paper we introduce the concept of signed edge total domination number γ~′_(st)(G) of a graph G,characterize all connected graphs with δ(G)2 and γ~′_(st)(G)=｜E(G)｜.obtain a lower bound of γ~′_(st)(G) for all k-regular graphs of order n,and determine the exact value of γ~′_(st)(W_(n+1)) of for all wheels W_(n+1) ,In addition,we pose a conjecture about the upper bound of γ~′_(st)(G).