Degree sequences of graphs containing a cycle with prescribed length
Degree sequences of graphs containing a cycle with prescribed length
复制标题
DOI：
10.1007/s10587-009-0032-4
复制
发表时间：
2009-06
影响因子：
0.5
通讯作者：
Jianhua Yin
中科院分区：
文献类型：
--
作者：
Jianhua Yin
Letr≥ 3,n≥rand π = (d1,d2, ...,dn) 是非负整数的非增序列。如果 π 有一个实现 G，其顶点 setV(G) = {v1,v2, ...,vn} 使得 dG(vi) =difori= 1, 2, ...,nandv1v2...vrv1 是一个长度为 rinG 的循环，则 π 被称为潜在的 Cr″-图形。在本文中，我们给出了 π 的潜在 Cr″ 图形特征。
Letr≥ 3,n≥rand π = (d1,d2, ...,dn) be a non-increasing sequence of nonnegative integers. If π has a realizationGwith vertex setV(G) = {v1,v2, ...,vn} such thatdG(vi) =difori= 1, 2, ...,nandv1v2...vrv1is a cycle of lengthrinG, then π is said to be potentiallyCr″-graphic. In this paper, we give a characterization for π to be potentiallyCr″-graphic.