| 围长为3的点可迁图的3限制边连通度 |
| |
| 引用本文： | 欧见平,张福基.围长为3的点可迁图的3限制边连通度[J].数学研究与评论,2005,25(1):58-63. |
| |
| 作者姓名： | 欧见平 张福基 |
| |
| 作者单位： | 1. 五邑大学数理系,广东,江门,529020;漳州师院数学系,福建,漳州,363000
2. 厦门大学数学系,福建,厦门,361005 |
| |
| 基金项目： | NationalNaturalScienceFoundationofChina(10271105)
FoundationofEducationMinistryofFujian(JA03147)
MinistryofScienceandTechnologyofFujian(2003J036) |
| |
| 摘 要： | 设G是阶至少为6的k正则连通图.如果G的围长等于3,那么它的3限制边连通度 λ3(G)≤3k-6.当G是3或者4正则连通点可迁图时等号成立,除非G是4正则图并且 λ3(G)=4.进一步,λ3(G)=4的充分必要条件是图G含有子图K4.
|
| 关 键 词： | 点可迁图 3限制边连通度 限制断片 |
| 收稿时间： | 2002/9/29 0:00:00 |
3-Restricted Edge Connectivity of Vertex Transitive Graphs of Girth Three |
| |
| OU Jian-ping and ZHANG Fu-ji.3-Restricted Edge Connectivity of Vertex Transitive Graphs of Girth Three[J].Journal of Mathematical Research and Exposition,2005,25(1):58-63. |
| |
| Authors: | OU Jian-ping and ZHANG Fu-ji |
| |
| Institution: | Dept. Math. Phys., Wuyi University, Jiangmen 529020, China; Dept. Math., Zhangzhou Normal College, Fujian 363000, China;Dept. Math., Xiamen University, Fujian 361005, China |
| |
| Abstract: | Let G be a k-regular connected graph of order at least six. If G has girth three,its 3-restricted edge connectivity λ3(G) (≤) 3k - 6. The equality holds when G is a cubic or4-regular connected vertex-transitive graph with the only exception that G is a 4-regular graphwith λ3(G) = 4. Furthermore, λ3(G) = 4 if and only if G contains K4 as its subgraph. |
| |
| Keywords: | vertex-transitive graph 3-restricted edge connectivity restricted fragment |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《数学研究与评论》浏览原始摘要信息 |
| 点击此处可从《数学研究与评论》下载免费的PDF全文 |
|
