科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let G be a connected graph of order n, and let k >= 2 and m >= 0 be two integers. In this paper, we show that G is a fractional (k, m)-deleted graph if delta(G) >= k + m + (m+1)(2)-1/4k n >= 9k - 1 - 4 root 2(k - 1)(2) + 2 + 2(2k + 1)m and |N(G)(x) boolean OR N(G)(y)| >= 1/2 (n + k - 2) for each pair of non-adjacent vertices x, y of G. This result is an extension of the previous result of Zhou [11].
- 出版日期2010-1
- 单位江苏科技大学
