Hongping Hu
Abstract
In this paper, the U-track and strictly directed bipartite graph are defined. A sufficicent and necessary condition for digraph having Hamiltonian path by use of the defintion of U-track and a sufficient condition for strictly directed bipartite graph to be hamiltonian by use of the definition of Hamiltonian path are proved.
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.
In this paper, the U-track and strictly directed bipartite graph are defined. A sufficicent and necessary condition for digraph having Hamiltonian path by use of the defintion of U-track and a sufficient condition for strictly directed bipartite graph to be hamiltonian by use of the definition of Hamiltonian path are proved.
Key concepts: Digraph, Hamiltonian path problem, Hamiltonian path, Bipartite graph, Mathematics, Hamiltonian (control theory), Combinatorics, Directed graph