最小度和[a,b]-对等图

Minimum Degree and [a,b]-Uniform Graphs

既是[a,b]-覆盖又是[a,b]-消去的图称为[a,b]-对等图.本文研究了最小度和[a,b]-对等图之间的关系,给出了一个图是[a,b]-对等图的关于最小度的充分条件.

Both [a, b]-covered and [a, b]-deleted graphs are [a, b]-uniform graphs. The relationship between minimum degree and [a,b]-uniform graphs is discussed. A sufficient condition for graphs with minimum degree to be [a,b]-uniform is given.