By Topic

Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kikuchi, Y. ; ERATO QCI Project, JST, Tokyo, Japan ; Araki, T.

A bipartite graph G is bipancyclic if G has a cycle of length l for every even 4 ≤l≤|V(G)|. For a bipancyclic graph G and any edge e, G is edge-bipancyclic if e lies on a cycle of any even length I of G. In this paper, we show that the bubble-sort graph Bn is bipancyclic for n≥ 4, and also show that it is edge-bipancyclic for n≥5. To obtain this results, we also prove that we can construct a hamiltonian cycle of Bn that contains given two nonadjacent edges. Assume that F is the subset of E(Bn). We prove that Bn -F is bipancyclic whenever n ≥4 and |F|≤ n-3. Since Bn is a (n-1)-regular graph, this result is optimal in the worst case.

Published in:

Parallel Architectures,Algorithms and Networks, 2005. ISPAN 2005. Proceedings. 8th International Symposium on

Date of Conference:

7-9 Dec. 2005