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

Minimum Degree for [a,b] -k- Uniform Graphs

设G=(V(G),E(G))是一个n阶图,1≤a<b及0≤k≤b是整数。证明了若图G的最小度δ(G)>n+(a+b)-2■bn-2k+1,则G是[a,b]-k-对等图。推广了已有的结果。

Let G=(V(G),E(G)) be a graph of order n, and let k, a and b be integers such that 1a<b,0kb.Then we prove that G is an [a,b]-k- uniform graph if the minimum degree 、啄(G)>n+(a+b)-2.This result is an extension of some results.