Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Bipanconnectivity and Bipancyclicity in k-ary n-cubes
Post: #1

Bipanconnectivity and Bipancyclicity in k-ary n-cubes

In this paper we give precise solutions to problems posed by Wang, an, Pan, Wang and Qu and by Hsieh, Lin and Huang. In particular, we show that Qn k is bipanconnected and edge-bipancyclic, when k ges 3 and n ges 2, and we also show that when k is odd, Qn k is m-panconnected, for m= (n (k-1) +2k-6)/2, and (k-1)-pancyclic (these bounds are optimal).

We introduce a path-shortening technique, called progressive shortening, and strengthen existing results,

Showing that when paths are formed using progressive shortening then these paths can be efficiently constructed and used to solve a problem relating to the distributed simulation of linear arrays and cycles in a parallel machine whose interconnection network is Qn k, even in the presence of a faulty processor.

Important Note..!

If you are not satisfied with above reply ,..Please


So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page

Quick Reply
Type your reply to this message here.

Image Verification
Image Verification
(case insensitive)
Please enter the text within the image on the left in to the text box below. This process is used to prevent automated posts.