Topological Properties of Hypercubes
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Super-connectivity and super-edge-connectivity for some interconnection networks
Applied Mathematics and Computation
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
Parallel Computing
The bipanconnectivity and m-panconnectivity of the folded hypercube
Theoretical Computer Science
Embedding of meshes in Möbius cubes
Theoretical Computer Science
Graph Theory and Interconnection Networks
Graph Theory and Interconnection Networks
Long paths in hypercubes with conditional node-faults
Information Sciences: an International Journal
1-vertex-fault-tolerant cycles embedding on folded hypercubes
Discrete Applied Mathematics
Long paths in hypercubes with a quadratic number of faults
Information Sciences: an International Journal
Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
Computers & Mathematics with Applications
An optimal result on fault-tolerant cycle-embedding in alternating group graphs
Information Processing Letters
Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links
Information Sciences: an International Journal
Distance formula and shortest paths for the (n,k)-star graphs
Information Sciences: an International Journal
Improving bounds on link failure tolerance of the star graph
Information Sciences: an International Journal
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
The 2-path-bipanconnectivity of hypercubes
Information Sciences: an International Journal
Hi-index | 0.07 |
A graph G is panconnected if, for any two distinct vertices x and y of G, it contains an [x, y]-path of length l for each integer l satisfying d"G(x,y)=