| 蕴含K5-Z4可图序列的刻划 |
| |
| 引用本文： | 胡黎莉,赖春晖.蕴含K5-Z4可图序列的刻划[J].漳州师院学报,2009(1):10-12. |
| |
| 作者姓名： | 胡黎莉 赖春晖 |
| |
| 作者单位： | 漳州师范学院数学与信息科学系,福建漳州363000 |
| |
| 基金项目： | 福建省自然科学基金资助项目（2008J0209）;漳州师范学院科研基金资助项目（L20817） |
| |
| 摘 要： | 对于给定的图H，称π是蕴含H可图的，如果π有一个实现包含H作为子图．Kk，Ck，Pk分别表示k阶完全图，圈长为k的圈和路长为k的路．Z4表示K4-P2.K5-Z4表示从5阶完全图中删去Z4的4条边．本文刻划了当n≥5时，蕴含K5—Z4的可图序列．
|
| 关 键 词： | 图 度序列 蕴含K5-Z4可图序列 |
On Potentially K5 - Z4 -graphic Sequences |
| |
| HU Li-li,LAI Chun-hui.On Potentially K5 - Z4 -graphic Sequences[J].Journal of ZhangZhou Teachers College(Philosophy & Social Sciences),2009(1):10-12. |
| |
| Authors: | HU Li-li LAI Chun-hui |
| |
| Institution: | (Department of Mathematics, Zhangzhou Normal University, Zhangzhou, Fujian 363000, China) |
| |
| Abstract: | For given a graph H, a graphic sequence π=（d1,d2……dn） is said to be potentially H graphical if 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. We use the symbol Z4 to denote K4 -P2. K5-Z4 is the graph obtained from K5 by removing 4 edges of Z4,In this paper, we characterize the potentially K 5-Z4 -graphic sequences. |
| |
| Keywords: | graph degree sequence potentially K5-Z4-graphic sequences |
| 本文献已被 维普 等数据库收录！ |
