本文研究有向图的全有效控制集.通过对无圈有向图结构特征的刻画,给出了简单图G在定向D下有全有效控制集的充要条件,并对几类特殊图的全有效数进行了计算。
In this paper, we study the total efficient dominating set of a digraph. By describing the structures of acyclic digraphs, we get a sufficient and necessary condition for a simple graph G admiring an orientation D, which has a total efficient dominating set. We also calculate the number of the total efficiencies of several kinds of graphs.