| 2－连通图的最长路 |
| |
| 引用本文： | 陈瑞袁.2－连通图的最长路[J].福建师范大学学报(自然科学版),1994(2). |
| |
| 作者姓名： | 陈瑞袁 |
| |
| 摘 要： | 设Ｇ是２－连通图，对Ｇ中任一对不相邻的顶点ｕ，ｖ，｜Ｎ（ｕ）∪Ｎ（ｖ）｜≥ｓ．Ｆａｕｄｒｅｅ猜测，当Ｇ的顶点数 ｓ为奇数时，Ｇ的最长路的顶点数 本文证明猜测当ｓ＞３时是真的．进而证明了除一类图外Ｐ（Ｇ）≥ｍｉｎ｛｜ｖ（Ｇ）｜，２ｓ＋ｌ｝．
|
| 关 键 词： | 2－连通图，邻城，路，最长路 |
The Longest Paths in 2-connected Graphs |
| |
| Chen Ruiyuan.The Longest Paths in 2-connected Graphs[J].Journal of Fujian Teachers University(Natural Science),1994(2). |
| |
| Authors: | Chen Ruiyuan |
| |
| Institution: | Department of Mathematics |
| |
| Abstract: | |
| |
| Keywords: | connected graph neighborhood path longest path |
| 本文献已被 CNKI 等数据库收录！ |
