一类有向图为Hamilton图的判定

The Determination of Digraph to Be Directedly Hamilton Graph

利用邻接矩阵研究有向图的Hamilton问题.讨论了研究有向图的Hamilton图的充要条件.设矩阵A为具有n个顶点的严格有向图D的邻接矩阵,则D为有向Hamilton图的充要条件为A的行列式的展…ajnj1非零.开式中至少有一项(-1)τ(j1j2…jn)+τ(j2j3…jnj1)

Studing the Hamiltonian circuits of digraph using adjacency matrix, the sufficient and necessary condition of strict digraph to be directedly Hamilton is discussed. Let \%A\% be adjacency matrix of strict digraph, then a sufficient and essential condition of \%D\% to be directedly Hamiltonian graph is that there at least exists a nonitem (-1)\+\{\%τ(j\-1j\-2\:j\-n)+τ(j\-2j\-3\:j\-nj\-1)\}a\-\{j\-1j\-2\}a\-\{j\-2j\-3\}\:a\-\{j\-nj\-1\}\% in expansion of the determinant of \%A\%.