科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper we mainly prove that let G be a (k + 1)-edge-connected simple graph of order n with girth g. Then G is upper embeddable if Sigma(nu is an element of I(G)) d(G)(nu) >= n - 2g + 5 - 3k - (g - 5)k(2) for any independent set I(G) = {nu(i) vertical bar 1 <= i <= k(2) + 2}, k = 0, 1, 2 and the lower bound is tight.
