| 0－1多面体图连通度猜想的一个反例 |
| |
| 引用本文： | 原晋江. 0－1多面体图连通度猜想的一个反例[J]. 新疆大学学报(理工版), 1995, 0(3) |
| |
| 作者姓名： | 原晋江 |
| |
| 作者单位： | 郑州大学数学系 |
| |
| 摘 要： | 本文给出０－１多面体图连通度猜想的一个反侧．由此说明０－１多面体图的连通度未必等于最小度．
|
| 关 键 词： | 0－1多面体；顶点；边；连通度 |
A Counter Example of a Conjecture On the Connectivity of 0-1 Polytope Graphs |
| |
| Yearn Jinjiang. A Counter Example of a Conjecture On the Connectivity of 0-1 Polytope Graphs[J]. Journal of Xinjiang University(Science & Engineering), 1995, 0(3) |
| |
| Authors: | Yearn Jinjiang |
| |
| Affiliation: | kept. of Math .Zhengzhou Univ |
| |
| Abstract: | This paper gives a counter example of a conjecture on the connectivity of 0-1 polytope graphs. This shows that the connectivity of a O-1 polytope graph is not necessarily equal to its minimum degree. |
| |
| Keywords: | polytope vertex edge connectivity |
| 本文献已被 CNKI 等数据库收录！ |
