Determinant Calculation of Directed Cycles andCondition for Hamilton Digraph

In this paper, several definitions are provided, such as the multiplication of directed path, arc determinant and so on. Some fundamental qualities of arc determinant are discussed and two determinant approaches to calculating the directed cycles of the digraph are expounded. One necessary and sufficient condition for a digraph to be a Hamilton digraph is put forward. Finally, a case is discussed.