XU Li-Xin, Xia Dong-qing, Zhou Hou-qing
Abstract
The necessary and sufficient condition for a digraph existing directed 2-factors is put forward by introducing arc determinant;meanwhile,the necessary and sufficient condition for a n-order digraph to be a Hamiltonian graph is provided as well.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The necessary and sufficient condition for a digraph existing directed 2-factors is put forward by introducing arc determinant;meanwhile,the necessary and sufficient condition for a n-order digraph to be a Hamiltonian graph is provided as well.
Key concepts: Digraph, Hamiltonian (control theory), Hamiltonian path, Mathematics, Arc (geometry), Directed graph, Combinatorics, Graph