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

收缩临界6连通图的6度顶点
引用本文:卢建立,张志芳. 收缩临界6连通图的6度顶点[J]. 数学的实践与认识, 2011, 41(13)
作者姓名:卢建立  张志芳
作者单位:河南师范大学数学与信息科学学院,河南新乡,453007
基金项目:河南省杰出青年计划(084100510013); 河南省高校科技创新人才支持计划(2008 HASTIT023)
摘    要:利用断片的性质,改进了齐恩凤,齐登记等的研究结果,得到了收缩临界6-连通图中6度点的性质的新结果:设x是G中任意一点,设A是一个x-原子,记N_A=T_A,N(x)∩T_A≠Φ,则A∩T_A中有与x相邻的6度点或两点的距离为2.

关 键 词:收缩临界6-连通图  断片  最小点割  S-原子

Vertices of Degree 6 for Contraction-Critical 6-Connected Graph
Lu Jian-li,Zhang Zhi-fang. Vertices of Degree 6 for Contraction-Critical 6-Connected Graph[J]. Mathematics in Practice and Theory, 2011, 41(13)
Authors:Lu Jian-li  Zhang Zhi-fang
Affiliation:Lu Jian-li,Zhang Zhi-fang (School of Mathematics and System Science,Henan Normal University,Xinxiang 453007,China)
Abstract:In this paper,adopting he nature of fragments,we improved the results of Qi Enfeng and Qi Dengji,and got he following new result:let x is a arbitrary vertex and A is a x-atom in a contraction-critical 6-connected graph,bear in mind that,here exists vetex of degree 6 which adjacent with the vetex x or the distance of the two vetex is 2 in A∩T_a
Keywords:contraction-critical 6-connected graph  fragment  smallest separating set  satom  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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