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

三边连通超欧拉图的一个注记
引用本文:李宵民,李登信.三边连通超欧拉图的一个注记[J].数学研究与评论,2010,30(5):944-946.
作者姓名:李宵民  李登信
作者单位:重庆工商大学数学与统计学院, 重庆 400067;重庆工商大学数学与统计学院, 重庆 400067
基金项目:重庆市教育委员会科技项目(Grant No.KJ100725).
摘    要:For two integers l 0 and k ≥ 0,define C(l,k) to be the family of 2-edge connected graphs such that a graph G ∈ C(l,k) if and only if for every bond S-E(G) with |S| ≤ 3,each component of G-S has order at least(|V(G)|-k)/l.In this note we prove that if a 3-edge-connected simple graph G is in C(10,3),then G is supereulerian if and only if G cannot be contracted to the Petersen graph.Our result extends an earlier result in Supereulerian graphs and Petersen graph.JCMCC 1991,9:79-89] by Chen.

关 键 词:supereulerian  collapsible  reduction  3-edge-connected.
收稿时间:2008/8/19 0:00:00
修稿时间:2009/6/30 0:00:00

A Note on the 3-Edge-Connected Supereulerian Graphs
Xiao Min LI and Deng Xin LI.A Note on the 3-Edge-Connected Supereulerian Graphs[J].Journal of Mathematical Research and Exposition,2010,30(5):944-946.
Authors:Xiao Min LI and Deng Xin LI
Institution:School of Mathematics and Statistics,Chongqing Technology and Business University,Chongqing 400067,P.R.China
Abstract:For two integers $l>0$ and $k\geq 0$, define $C(l,k)$ to be the family of 2-edge connected graphs such that a graph $G\in C(l,k)$ if and only if for every bond $S\subseteq E(G)$ with $|S|\leq 3$, each component of $G-S$ has order at least $(|V(G)|-k)/l$. In this note we prove that if a 3-edge-connected simple graph $G$ is in $C(10,3)$, then $G$ is supereulerian if and only if $G$ cannot be contracted to the Petersen graph. Our result extends an earlier result in Supereulerian graphs and Petersen graph. JCMCC 1991, 9: 79-89] by Chen.
Keywords:supereulerian  collapsible  reduction  3-edge-connected  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《数学研究与评论》浏览原始摘要信息
点击此处可从《数学研究与评论》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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