Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Information Processing Letters
Hamiltonian Cycles with Prescribed Edges in Hypercubes
SIAM Journal on Discrete Mathematics
Graph Theory With Applications
Graph Theory With Applications
Path bipancyclicity of hypercubes
Information Processing Letters
Cycles passing through prescribed edges in a hypercube with some faulty edges
Information Processing Letters
Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Sciences: an International Journal
Edge-bipancyclicity of conditional faulty hypercubes
Information Processing Letters
Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
Journal of Graph Theory
A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
Information Processing Letters
On path bipancyclicity of hypercubes
Information Processing Letters
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
Cycles passing through a prescribed path in a hypercube with faulty edges
Information Processing Letters
Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
Information Processing Letters
A note on cycle embedding in hypercubes with faulty vertices
Information Processing Letters
Fault-free Hamiltonian cycles passing through a linear forest in ternary n-cubes with faulty edges
Theoretical Computer Science
| Hi-index | 0.89 |
Assume that P is any path in a bipartite graph G of length k with 2==3 is (2n-3)-path bipancyclic but is not (2n-2)-path bipancyclic, moreover, a path P of length k with 2==2, moreover, the upper bound 2n-1 is sharp when n=4.