摘要
设σ(G,n)是具有下述性质的最小正偶数,每一项和至少为σ(G,n)的n项可图序列π都有一个实现包含G作为子图.本文给出σ(K5-e,7)=32,σ(K5-e,8)=36,以及当n≥9时,σ(K5-e,n)=2[5n2-6].
A sequence π is potentially K5- e graphical if it has a realization containing a n）denote the smallest degree sum such that every graphical .sequence π with σ（π）≥π（K5- e,n） is potentially K5-e graphical. In this paper, we prove that σ（K5-e,7）=32,σ（K5-e,8）=36, and for n≥9.σ（K5-e,n）=2[（5n/6）/2].
出处
《新疆大学学报（自然科学版）》
CAS
2005年第3期276-284,共9页
Journal of Xinjiang University(Natural Science Edition)
关键词
蕴含K5-e可图序列
度序列
实现
potentially K5- e graphical sequence
degree sequence
realization
