On the cycle structure of hamiltonian k-regular bipartite graphs of order 4k

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

3 pages

Scientific paper

It is shown that a hamiltonian $n/2$-regular bipartite graph $G$ of order
$2n>8$ contains a cycle of length $2n-2$. Moreover, if such a cycle can be
chosen to omit a pair of adjacent vertices, then $G$ is bipancyclic.

No associations

LandOfFree

Say what you really think

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

Rating

On the cycle structure of hamiltonian k-regular bipartite graphs of order 4k 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 On the cycle structure of hamiltonian k-regular bipartite graphs of order 4k, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the cycle structure of hamiltonian k-regular bipartite graphs of order 4k will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-248845

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