摘要
对于给定的图H,称π是蕴含H可图的,如果π有一个实现包含H作为子图.K k,C k,Pk分别表示k阶完全图,圈长为k的圈和路长为k的路.本文刻划了当n≥6时,蕴含(K 4-e)+K3的可图序列,其中,(K 4-e)+K3如下图所示.
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.In this paper,we characterize the potentially(K4-e)+K3-graphic sequences.
出处
《漳州师范学院学报(自然科学版)》
2010年第1期13-17,共5页
Journal of ZhangZhou Teachers College(Natural Science)
基金
福建省自然科学基金资助项目(2008J0209)
漳州师范学院科研基金资助项目(SK09018)