二连通图的最长圈 |
| |
引用本文: | 党恺谦. 二连通图的最长圈[J]. 辽宁大学学报(自然科学版), 1993, 20(2): 22-25 |
| |
作者姓名: | 党恺谦 |
| |
作者单位: | 东北工学院数学系 |
| |
摘 要: | 本文证明:设G为n阶2连通图,D(x)={y|y∈V(G),d(x,y)≤2},d_d~*(x)表示D(x)中所有的点的度排成的非减度序列:d_1~*,d_2~*,…,d_j~*,d_(j+1)~*,…,d_(|D(x)|)~*中当下标j=d(x)时的度。δ_0=min{d(x)|x∈V(G)},D(δ_(i-1))={x|x∈V(G),d(x)≥δ(i-1)}(i=1,2,…,k),δ_i=min{d_(d(x))~*|x∈D(δ(i-1))}(i=1,2,…,k)且δ_0<δ_1<δ_2<…<δ_(k-1)≤δ_k,则C(G)≥min{n,2δ_k}。此外也给出δ_k的算法。
|
关 键 词: | 最长圈 哈密顿图 2连通图 连通图 |
Large Cycles of 2-Connected Graphs Dang Kaigian |
| |
Affiliation: | Department of Mathematics Northeast University of Technology |
| |
Abstract: | |
| |
Keywords: | Large cycles 2-connected Hamilton graph. |
本文献已被 CNKI 维普 等数据库收录! |
|