两类图的2符号全控制数

2-Signed total domination number of two classes graphs

设图G=(V,E)为一个简单图,且δ(G)≥1,令f:V(→){-2,-1,1,2}是图G上的一个函数,如果对任意的顶点v∈V,均有f(N(v))≥1成立,则称f为图G的一个2符号全控制函数.主要用分类讨论方法和穷标法得到路Pm和圈Cm的2符号全控制数的精确值.

Let G=(V,E) be a graph and δ(G)≥1 . A function f:V■{-2,-1,1,2} is said to be a 2-signed total domination function if f(N(v))≥1 for v∈V . In this paper, the exact values of the 2-signed total domination number of path P m and cycle C m are determined by exhaustived method and classified discussion.