蕴含强哈密尔顿连通性的几个条件

Some Conditions for a Digraph to be Strongly Hamiltonian-Connected

利用收缩技术,推广了有向图理论中哈密尔顿性问题的几个结论,给出了有向图是强哈密尔顿连通的最小半度、度和、最少边数等条件.

Using the coutraction technique,we gencralize some results on Hamiltonian digraphs, and present some sufficient conditions involving minimum semi-degree, minimum degree sum and the number of arcs of arcs to force a digraph to be strongly Hamiltonian-onnected.