| 1. | Theorem 2 . 5 suppose g be 2 connected weighted graph with a
定理2石设g是2连通赋权阂终。 |
| 2. | Therefore , studying the weighted graph can obtain the more general result
因此，研究赋权图将得到更普遍的结论。 |
| 3. | In this paper , we mainly study heavy cycles in weighted graphs and ore type condition
本篇论文主要研究了赋权图中的重圈存在性与ore型条件 |
| 4. | In the third section , we get the extremal graph of weighted graph whose connectivity is 2
在第三节中得到连通度为2的赋权图在ore型条件下的极图 |
| 5. | Theorem 5 let g is a 2 - connected nonhamilton weighted graph satisfying conditions d1 and d2
定理5设g是满足条件di和dz的2一连通非hamiltort赋权图 |
| 6. | Etc . studied the heaviest cycle in weighted graph and got many results in [ 2 ] , [ 3 ]
Bondy ，范更华等图论专家在这方面做了大量研究，得到许多结果 |
| 7. | A graph g is called a weighted graph if each edge e is assigned a non - negative number w ( e ) , called the weight of e
图g称为赋权图，若每条边e被指定一个非负数w ( e ) ，称为e的权。 |
| 8. | In this thesis , grid partitioning is converted to an unoriented and weighted graph , on which partitioning algorithm is studied
本文将网格分区问题转化为无向赋权图的分区，在图上研究分区算法。 |
| 9. | Gave fan type condition in [ 1 ] . research on the heaviest cycle in weighted graph is an important aspect . j . a . bondy and fan g . h
研究赋权图中的重目是研究赋权图的一个重要内容；并且赋权图中的重圈问题是图中长圈问题的相应推广 |
| 10. | In the second section , we generalize theorem 2 . 3 on the existence of the longest cycle of ore type condition to weighted graphs and get theorem 2 . 5
在第二节中主要把有关ore型条件下图中长圈存在性的下述定理推广到赋权图电得到定理2 |
