科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let r >= 3, n >= r and pi = (d(1), d(2), ... , d(n)) be a non-increasing sequence of nonnegative integers. If pi has a realization G with vertex set V (G) = {v(1), v(2), ..., v(n)} such that d(G)(v(i)) = d(i) for i = 1, 2, ... , n and v(1)v(2) ... v(r)v(1) is a cycle of length r in G, then pi is said to be potentially C(r)''-graphic. In this paper, we give a characterization for pi to be potentially C(r)''-graphic.
- 出版日期2009-6
- 单位海南大学
