Computer Science – Discrete Mathematics

Scientific paper

[
0.00
] – not rated yet
Voters
0
Comments 0

2008-12-23

Computer Science

Discrete Mathematics

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

LandOfFree

If you have personal experience with

Some sufficient conditions on Hamiltonian digraphdoes not yet have a rating. At this time, there are no reviews or comments for this scientific paper.Some sufficient conditions on Hamiltonian digraph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some sufficient conditions on Hamiltonian digraph will most certainly appreciate the feedback.

Profile ID: LFWR-SCP-O-605305

Use Google custom search:

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