摘要
对于给定的图H，称π是蕴含H可图的，如果万有一个实现包含H作为子图．Kk，Ck，Pk分别表示k阶完全图，圈长为k的圈和路长为k的路．K1,4＋e表示K1,4添加一条边后构成的具有5个顶点5条边的简单图．Luo Rongu考虑了蕴含Ck可图序列的刻划问题，并刻划了当k=3，4，5时，蕴含Ck的可图序列．此外，Luo等人刻划了蕴含K4的可图序列．Eschen和Niu刻划了蕴含K4-e的可图序列．Yin Jianhua等人刻划了当r=2，S=3和r=2，S=4时，蕴含Kr,s的可图序列，其中Kr,s是r×S完全二部图．Hu Lili等人刻划了蕴含K5-C4，K5-Z4的可图序列．本文刻划了当n≥5时，蕴含K1,4＋e的可图序列．
For Given a graph H, a graphic sequence π=（d1,d2,...,dn） issaidtobc potentially H graphical ff it has a realization containing H as a subgraph. Let Kk, Ck and Pk denote a complete graph on k vertices, a cycle on k vertices and a path on k ＋ 1 vertices, respectively. Let K1,4 ＋ e be a graph obtained by adding an edge to K1,4 which has 5 vertices and 5 edges. Luo Rong characterized the potentially Ck -graphic sequences for each k = 3,4,5. Recently, Luo and Warner characterized the potentially K4 -graphic sequences. Eschen and Niu characterized the potentially K4 -e-graphic sequences . Yin and Chen characterized the potentially Kr,s -graphic sequences for r = 2, s = 3 and r = 2, s = 4. Hu and Lai characterize the potentially K 5-C4 and Ks-Z4 -graphic sequences. In this paper, we characterize the potentially K1,4 ＋ e -graphic sequences.
出处
《漳州师范学院学报（自然科学版）》
2007年第1期4-8,共5页
Journal of ZhangZhou Teachers College（Natural Science)
基金
福建省自然科学基金资助项目(Z0511034)
关键词
图
度序列
蕴含K1
4+e可图序列
graph
degree sequence
potentially K1,4 ＋ e-graphic sequences
