Topological Properties of Hypercubes
IEEE Transactions on Computers
The twisted cube topology for multiprocessors: a study in network asymmetry
Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
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
Embedding of Cycles in Arrangement Graphs
IEEE Transactions on Computers
IEEE Transactions on Computers
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Information Processing Letters
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Pancyclicity on Möbius cubes with maximal edge faults
Parallel Computing
Graph Theory With Applications
Graph Theory With Applications
Edge-pancyclicity of Möbius cubes
Information Processing Letters
Paths in Möbius cubes and crossed cubes
Information Processing Letters
Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges
IEEE Transactions on Computers
Geodesic pancyclicity and balanced pancyclicity of Augmented cubes
Information Processing Letters
Node-pancyclicity and edge-pancyclicity of hypercube variants
Information Processing Letters
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science
Discrete Applied Mathematics
Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Sciences: an International Journal
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
Hi-index | 0.00 |
A graph G is said to be pancyclic if it contains cycles of all lengths from 4 to |V (G)| in G. For any two vertices u, v ∈ V (G), a cycle is called a geodesic cycle with u and v if a shortest path joining u and v lies on the cycle. Let G be a bipartite graph. For any two vertices u and v in G, a cycle C is called a balanced cycle between u and v if dC(u, v) = max{dC(x, y) | dG(x, u) and dG(y, v) are even, resp. for all x, y ∈ V (G)}. A bipartite graph G is geodesic bipancyclic (respectively, balanced bipancyclic) if for each pair of vertices u, v ∈ V (G), it contains a geodesic cycle (respectively, balanced cycle) of every even length of k satisfying max{2dG(u, v), 4} ≤ k ≤ |V (G)| between u and v. In this paper, we prove that Qn is geodesic bipancyclic and balanced bipancyclic if n ≥ 2.