图的负边全控制数

Minus Total Edge Domination Number of Graphs

设图G=(V,E),定义了图的负边全控制函数和负边全控制数.研究了图的负边全控制数的在路和圈上的精确值,另外得到了负边全控制数的一个上界和关于边数、最大度和最小度的一个下界.

Let G=（V,E） be a graph of order n and size m.A minus total edge dominating function of G and minus total edge domination number are defined.Some rusuits for path and cycle are established,then an upper bound for general graph are given.Furthermore,A lower bound on γ-et（G） for a graph with order n,size m,maxuimum degree Δ and minimum degree δ are obtained.