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

4连通图的可去边与4连通图的构造
引用本文:尹建华.4连通图的可去边与4连通图的构造[J].系统科学与数学,1999,19(4):434-438.
作者姓名:尹建华
作者单位:中国科学技术大学数学系!合肥230026
摘    要:本文引进了4连通图的可去边的概念,,并证明了4连通图G中不存在可去边的充要条件是G=C5或C6,同时给出了n阶4连通图的一个新的构造方法.

关 键 词:连通图  可去边  收缩边  2循环图

REMOVABLE EDGES IN 4-CONNECTED GRAPHS AND A STRUCTURE OF 4-CONNECTED GRAPHS
Jian Hua YI.REMOVABLE EDGES IN 4-CONNECTED GRAPHS AND A STRUCTURE OF 4-CONNECTED GRAPHS[J].Journal of Systems Science and Mathematical Sciences,1999,19(4):434-438.
Authors:Jian Hua YI
Institution:Department Of Mathematics, University of Science and Technology Of China, Hefei 230026,P.R.China
Abstract:in this paper, we define removable edges in a 4-connected graph and provethat the graph without removable edge is C5 or C6. We also give a structure of 4--connectedgraphs of order n.
Keywords:Connected graph  removable edge  contractible edge  2-cyclic graph  
本文献已被 CNKI 等数据库收录!
点击此处可从《系统科学与数学》浏览原始摘要信息
点击此处可从《系统科学与数学》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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