首页 | 本学科首页   官方微博 | 高级检索  
     检索      

蕴含H可图序列
引用本文:徐正华.蕴含H可图序列[J].漳州师院学报,2008(3):7-9.
作者姓名:徐正华
作者单位:[1]漳州师范学院数学与信息科学系,福建漳州363000
基金项目:漳州师范学院科研基金资助项目(SK07009);福建省自然科学基金资助项(2008J0209)
摘    要:对于给定的图H,称π是蕴含H可图的,如果π有一个实现包含H作为子图.本文给出了蕴含H可图序列的一个充要条件,还给出了最大度为4的可图序列的一个充要条件.

关 键 词:  度序列  蕴含H可图序列

Potentially H -graphic Sequences
XU Zheng-hua.Potentially H -graphic Sequences[J].Journal of ZhangZhou Teachers College(Philosophy & Social Sciences),2008(3):7-9.
Authors:XU Zheng-hua
Institution:XU Zheng-hua (Department of Mathematics and Information Science, 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 n as a subgraph. In this paper, we give a necessary and sufficient condition for a sequence π∈ NSn to be potentially H -graphic, we also give a necessary and sufficient condition for a sequence π ∈ NSn to be graphic if the maximal degree is at most 4.
Keywords:graph  degree sequence  potentially H -graphic sequences
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号