Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
A bipartite graph G is bipancyclic if G has a cycle of length 1 for every even 4  = 4 and also show that it is edge-bipancyclic for n >= 5. Assume that F is a subset of E (B-n). We prove that B-n - F is bipancyclic, when n >= 4 and vertical bar F vertical bar <= n -3. Since B-n is a (n-1)-regular graph, this result is optimal in the worst case. (c) 2006 Elsevier B.V. All rights reserved.
bubble-sort graph interconnection networks pancyclicity edge-pancyclicity