| 无三边形极小3连通图的非基本边数 |
| |
| 引用本文： | 潘玉美. 无三边形极小3连通图的非基本边数[J]. 广西科学, 2008, 15(3): 231-232 |
| |
| 作者姓名： | 潘玉美 |
| |
| 作者单位： | 柳州师范高等专科学校数学与计算机科学系,广西柳州,545004 |
| |
| 摘 要： | 给出无三边形极小3连通图G的非基本边数的下界︱G︱ 3,并证明图G的非基本边数达到下界当且仅当G同构于K3,3.
|
| 关 键 词： | 连通图 无三边形 非基本边 |
| 收稿时间： | 2007-09-10 |
The Number of Non-essential Edges in Triangle-free Minimally 3-Connected Graphs |
| |
| PAN Yu-mei. The Number of Non-essential Edges in Triangle-free Minimally 3-Connected Graphs[J]. Guangxi Sciences, 2008, 15(3): 231-232 |
| |
| Authors: | PAN Yu-mei |
| |
| Affiliation: | Department of Mathematics and Computer Science, Liuzhou Teachers College, Liuzhou, Guangxi, 545004, China |
| |
| Abstract: | A lower for the number of non-essential edges of the triangle-free minimally 3-connected graph and the characterization of the graph that reach the lower bound are given. |
| |
| Keywords: | connected graph triangle-free non-essential edge |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《广西科学》浏览原始摘要信息 |
|
点击此处可从《广西科学》下载免费的PDF全文 |
