| 一类3—连通图的周长 |
| |
| 引用本文： | 张莲珠.一类3—连通图的周长[J].新疆大学学报(理工版),1992,9(4):27-33,45. |
| |
| 作者姓名： | 张莲珠 |
| |
| 作者单位： | 漳州师范学院数学系 |
| |
| 摘 要： | 设G=(V,E)是一个n阶无向简单图,本文证明了:设G是一个3-连通图,若G的每一个最长圈是控制圈,则G的周长c(G)≥min{n,2NC_2}或G同构于Petersen图,其中NC_2={|N(u)∪N(v)||u,v∈V(G),d(u,v)=2}。
|
| 关 键 词： | 控制圈 邻域并 周长 连通图 |
The Circumference in a Kind of 3-connected Graphs |
| |
| Zhang Lianzhu.The Circumference in a Kind of 3-connected Graphs[J].Journal of Xinjiang University(Science & Engineering),1992,9(4):27-33,45. |
| |
| Authors: | Zhang Lianzhu |
| |
| Institution: | Zhang Lianzhu Department of Mathematices,Zhangzhou Normal College,Fujian |
| |
| Abstract: | |
| |
| Keywords: | dominating cycle neighborhood circumference |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
