摘要: |
给出无三边形极小3连通图G的非基本边数的下界︱G︱+3,并证明图G的非基本边数达到下界当且仅当G同构于K3,3. |
关键词: 连通图 无三边形 非基本边 |
DOI: |
投稿时间:2007-09-10 |
基金项目: |
|
The Number of Non-essential Edges in Triangle-free Minimally 3-Connected Graphs |
PAN Yu-mei
|
(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. |
Key words: connected graph triangle-free non-essential edge |