Abstract：The connectedness of digraph is discussed by using matrix approach. The matrix approaches to calculate the directed cycles of the digraph are expounded. The necessary and sufficient conditions for a digraph to be a Hamilton graph are obtained. Finally,an
2002, Vol. 26 