2-坚韧图是分数Hamiltonian

Every 2-tough graph is fractionally Hamiltonian

分数Hamilton图是比Hamilton图更广泛的图类.论文借用线性规划的知识给出了判定分数Hamilton图的新的充分必要条件,并利用新的充分必要条件证明了任意2-坚韧图是分数Hamiltonian.

Fractionally Hamilton graph was larger than Hamilton graph. According to the knowledge linear programming, we presented a new sufficient and necessary condition of fractionally Hamihonian Futhermore, making use it, we proved that every 2-tough graph was fractionally Hamiltonian.