科研之友
微信
新浪微博
Facebook
分享链接
摘要
A non-increasing sequence pi = (d(1),d(2), ... , d(n)) of non-negative integers is said to be graphic if it is the degree sequence of a simple graph G on n vertices. We say that G is a realization of pi (or pi is realizable by G). Let Z(3) be a cyclic group of order three. If pi has a realization G which is Z(3)-connected, then pi has a Z(3)-connected realization G. Yang et al. (2014) proposed the following problem: Characterize all graphic sequences pi realizable by a Z(3)-connected graph. In this paper, we solve this problem completely and present a complete characterization of graphic sequences with a Z(3)-connected realization.
- 出版日期2016-1
- 单位海南大学
