论文标题
多少规律性迫使序列是图形的？
How Much Regularity Forces a Sequence to be Graphic?
论文作者
论文摘要
对于整数序列（偶数总和），序列与规则的近距离越接近，序列越有可能是图形的。但是，必须始终是图形的序列必须是多少？我们表明，对于许多序列，如果所有值在平均值值的$ \ frac {n-2} {4} $之内，则该序列为图形。我们还看到该结果如何扩展以显示何时序列值之间的最大差异意味着序列是图形的。
For an integer sequence (with even sum), the closer that the sequence is to being regular, the more likely that the sequence is graphic. But how regular must a sequence be before it must always be graphic? We show that for many sequences if all values are within $\frac{n-2}{4}$ of the mean degree value, then the sequence is graphic. We also see how this result extends to show when a maximum difference between sequence values implies that a sequence is graphic.
