Some sufficient conditions on Hamiltonian digraph

Computer Science – Discrete Mathematics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0


7 pages, the main result did during 2007

Scientific paper

Z-mapping graph is a balanced bipartite graph $G$ of a digraph $D$ by split each vertex of $D$ into a pair of vertices of $G$. Based on the property of the $G$, it is proved that if $D$ is strong connected and $G$ is Hamiltonian, then $D$ is Hamiltonian. It is also proved if $D$ is Hamiltonian, then $G$ contains at least a perfect matching. Thus some existence sufficient conditions for Hamiltonian digraph and Hamiltonian graph are proved to be equivalent, and two sufficient conditions of disjoint Hamiltonian digraph are given in this paper.

No associations


Say what you really think

Search for scientists and scientific papers. Rate them and share your experience with other people.


Some sufficient conditions on Hamiltonian digraph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Some sufficient conditions on Hamiltonian digraph, we encourage you to share that experience with our community. Your opinion is very important and Some sufficient conditions on Hamiltonian digraph will most certainly appreciate the feedback.

Rate now


Profile ID: LFWR-SCP-O-605305

All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.