Fault-tolerant hamiltonian laceability of hypercubes
Information Processing Letters
A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
Journal of Parallel and Distributed Computing
Hamiltonian Cycles with Prescribed Edges in Hypercubes
SIAM Journal on Discrete Mathematics
Graph Theory With Applications
Graph Theory With Applications
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
A (4n-9)/3 diagnosis algorithm on n-dimensional cube network
Information Sciences: an International Journal
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
The two-equal-disjoint path cover problem of Matching Composition Network
Information Processing Letters
Edge-bipancyclicity of a hypercube with faulty vertices and edges
Discrete Applied Mathematics
Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
Information Processing Letters
A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
Information Processing Letters
Information Processing Letters
The bipancycle-connectivity of the hypercube
Information Sciences: an International Journal
Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
SIAM Journal on Discrete Mathematics
Edge-fault-tolerant bipanconnectivity of hypercubes
Information Sciences: an International Journal
Long paths in hypercubes with conditional node-faults
Information Sciences: an International Journal
On the bipanpositionable bipanconnectedness of hypercubes
Theoretical Computer Science
Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
IEEE Transactions on Computers
On path bipancyclicity of hypercubes
Information Processing Letters
Many-to-many disjoint paths in faulty hypercubes
Information Sciences: an International Journal
Long paths in hypercubes with a quadratic number of faults
Information Sciences: an International Journal
Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
Information Processing Letters
Longest fault-free paths in hypercubes with vertex faults
Information Sciences: an International Journal
Many-to-many n-disjoint path covers in n-dimensional hypercubes
Information Processing Letters
Cycles passing through a prescribed path in a hypercube with faulty edges
Information Processing Letters
The panpositionable panconnectedness of augmented cubes
Information Sciences: an International Journal
Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
Information Processing Letters
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
| Hi-index | 0.07 |
In this paper, we introduce the concept of the k-path-(bi)panconnectivity of (bipartite) graphs. It is a generalization of the (bi)panconnectivity and of the paired many-to-many k-disjoint path cover. The 2-path-bipanconnectivity with only one exception of the n-cube Q"n (n=4) is proved. Precisely, the following result is obtained: In an n-cube with n=4 given any four vertices u"1, v"1, u"2, v"2 such that two of them are in one partite set and the another two are in the another partite set. Let s=t=5 if C=u"1u"2v"1v"2 is a cycle of length 4, and s=d(u"1,v"1)+1 and t=d(u"2,v"2)+1 otherwise, where d(u,v) denotes the distance between two vertices u and v. And let i and j be any two integers such that both i-s=0 and j-t=0 are even with i+j=