关于图的符号边全控制数

Let G = （V,E） be a graph.A function f ： E → {-1,1} is said to be a signed edge total dominating function （SETDF） of G if e ∈N（e） f（e ） ≥ 1 holds for every edge e ∈ E（G）.The signed edge total domination number γ st （G） of G is defined as γ st （G） = min{ e∈E（G） f（e）｜f is an SETDF of G}.In this paper we obtain some new lower bounds of γ st （G）.

On Signed Edge Total Domination Numbers of Graphs

Let $G=(V,E)$ be a graph. A function $f:E\rightarrow \{-1,1\} $ is said to be a signed edge total dominating function (SETDF) of $G$ if ${\sum_{e^{^{\prime }}\in N(e)} }f(e^{\prime})\geq 1$ holds for every edge $e\in E(G)$. The signed edge total domination number $\gamma_{st}^{\prime}(G)$ of $G$ is defined as $\gamma_{st}^{\prime}(G)=\min\{\sum_{e\in E(G)}f(e)|f$ is an SETDF of $G\}$. In this paper we obtain some new lower bounds of $\gamma_{st}^{\prime}(G)$.