| 极小3连通图的非基本边数 |
| |
| 引用本文： | 潘玉美,莫明忠.极小3连通图的非基本边数[J].广西科学,2007,14(1):15-18,21. |
| |
| 作者姓名： | 潘玉美 莫明忠 |
| |
| 作者单位： | 柳州师范高等专科学校数学与计算机科学系,广西柳州,545004 |
| |
| 摘 要： | 利用扇,断片及简约图的概念,得到不为轮的极小3连通图的非基本边数与其简约图的非基本边数相等,从而将求极小3连通图的非基本边数问题转化为求其简约图的非基本边数问题后,给出简约极小3连通图非基本边数的一个下界,刻画了达到下界的图类.
|
| 关 键 词： | 图 连通图 边数 扇 断片 |
| 文章编号： | 1005-9164（2007）01-0015-04 |
| 收稿时间： | 2006-04-18 |
| 修稿时间： | 2006-04-182006-06-12 |
The Number of Non-essential Edges in Minimally 3-Connected Graphs |
| |
| PAN Yu-mei and MO Ming-zhong.The Number of Non-essential Edges in Minimally 3-Connected Graphs[J].Guangxi Sciences,2007,14(1):15-18,21. |
| |
| Authors: | PAN Yu-mei and MO Ming-zhong |
| |
| Institution: | Department of Mathematics and Computer Science,Liuzhou Teachers College,Liuzhou,Guangxi, 545004,China |
| |
| Abstract: | The number of non-essential edges of the minimally 3-connnected graph G is the same as the that of its simplified graph G* based on the concepts of fan, fragment and simplified graph. Therefore, the evaluation of non-essential edges of the graph G can be changed into that of the graph G*.A lower bound for the number of non-essential edges of the graph G* and the characterization of the graphs that reach the lower bound are given. |
| |
| Keywords: | graph connected graphs the number of non-essential edges fan fragment |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《广西科学》浏览原始摘要信息 |
| 点击此处可从《广西科学》下载免费的PDF全文 |
