A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
The super laceability of the hypercubes
Information Processing Letters
The super-connected property of recursive circulant graphs
Information Processing Letters
Graph Theory With Applications
Graph Theory With Applications
The super connectivity of the pancake graphs and the super laceability of the star graphs
Theoretical Computer Science
On the spanning connectivity and spanning laceability of hypercube-like networks
Theoretical Computer Science
A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance
The Journal of Supercomputing
| Hi-index | 0.00 |
A k -container C(u,v) of a graph G is a set of k disjoint paths between u and v. A k-container C(u,v) of G is a k * -container if it contains all vertices of G. A graph G is k * -connected if there exists a k *-container between any two distinct vertices of G. Therefore, a graph is 1*-connected (respectively, 2*-connected) if and only if it is Hamiltonian connected (respectively, Hamiltonian). A graph G is super spanning connected if there exists a k *-container between any two distinct vertices of G for every k with 1驴k驴驴(G) where 驴(G) is the connectivity of G. A bipartite graph G is k * -laceable if there exists a k *-container between any two vertices from different partite set of G. A bipartite graph G is super spanning laceable if there exists a k *-container between any two vertices from different partite set of G for every k with 1驴k驴驴(G). In this paper, we prove that the enhanced hypercube Q n,m is super spanning laceable if m is an odd integer and super spanning connected if otherwise.