通过对图G边集分析的方法,对图的符号边全k控制问题进行了研究,得到了连通图G的符号边全k控制γskt(G)的2个下限,并确定了所有路符号边全k控制数.
The problem of the signed edge total k-domination in graph G is studied by partitioning the edge set of a graph G.Two new lower bounds of γ skt(G) are obtained,and the signed edge total k-domination numbers of all paths are determined.