A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
On the embedding of cycles in pancake graphs
Parallel Computing
Cycles in the cube-connected cycles graph
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Hamilton-connectivity and cycle-embedding of the Möbius cubes
Information Processing Letters
Pancyclicity of recursive circulant graphs
Information Processing Letters
Embedding of Cycles in Arrangement Graphs
IEEE Transactions on Computers
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
Ring embedding in faulty pancake graphs
Information Processing Letters
On the Fault-Tolerant Pancyclicity of Crossed Cubes
ICPADS '02 Proceedings of the 9th International Conference on Parallel and Distributed Systems
Edge-pancyclicity of recursive circulants
Information Processing Letters
Node-to-Node Internally Disjoint Paths Problem in Bubble-Sort Graphs
PRDC '04 Proceedings of the 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC'04)
Pancyclicity on Möbius cubes with maximal edge faults
Parallel Computing
Hamiltonian properties on the class of hypercube-like networks
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Hamiltonian laceability of bubble-sort graphs with edge faults
Information Sciences: an International Journal
Weak-vertex-pancyclicity of (n, k)-star graphs
Theoretical Computer Science
One conjecture of bubble-sort graphs
Information Processing Letters
Fault tolerance in bubble-sort graph networks
Theoretical Computer Science
(n-3)-edge-fault-tolerant weak-pancyclicity of (n,k)-star graphs
Theoretical Computer Science
| Hi-index | 0.89 |
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 l 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. Assume that F is a subset of E(Bn). We prove that Bn - F is bipancyclic, when n ≥ 4 and |F| ≤ n-3. Since Bn is a (n - 1)-regular graph, this result is optimal in the worst case.