Results 1  10
of
142,576
On the Construction of Paired ManytoMany Disjoint Path Covers in HypercubeLike Interconnection Networks with Faulty Elements
"... A paired manytomany kdisjoint path cover (kDPC) of a graph G is a set of k disjoint paths joining k distinct sourcesink pairs in which each vertex of G is covered by a path. This paper is concerned with paired manytomany disjoint path coverability of hypercubelike interconnection networks, c ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
A paired manytomany kdisjoint path cover (kDPC) of a graph G is a set of k disjoint paths joining k distinct sourcesink pairs in which each vertex of G is covered by a path. This paper is concerned with paired manytomany disjoint path coverability of hypercubelike interconnection networks
HypercubeLike Interconnection Networks with
, 2016
"... Panconnectivity and pancyclicity of hypercubelike interconnection networks with faulty elements. ..."
Abstract
 Add to MetaCart
Panconnectivity and pancyclicity of hypercubelike interconnection networks with faulty elements.
HypohamiltonianConnectedness and Pancyclicity of HypercubeLike Interconnection Networks with Faulty Elements
"... Abstract. We call a graph G to be ffault hamiltonianconnected (resp. ffault hypohamiltonianconnected) if for any set F of faulty elements (vertices and/or edges) with F  ≤ f, each pair of vertices in G\F are joined by a path of length V (G\F)  − 1 (resp. a path of length V (G\F)  − 2). ..."
Abstract
 Add to MetaCart
, and that if each Gi is ffault hamiltonianconnected, ffault hypohamiltonianconnected, and f + 1fault almost pancyclic, then G0 ⊕ G1 is f + 2fault almost pancyclic for any f ≥ 1. Many interconnection networks such as hypercubelike interconnection networks can be represented in the form of G0 ⊕ G1 connecting
Faulthamiltonicity of hypercubelike interconnection networks
 in Proc. of IEEE International Parallel and Distributed Processing Symposium IPDPS 2005
, 2005
"... We call a graph G to be ffault hamiltonian (resp. ffault hamiltonianconnected) if there exists a hamiltonian cycle (resp. if each pair of vertices are joined by a hamiltonian path) in G\F for any set F of faulty elements with F ≤f. In this paper, we deal with the graph G0 ⊕ G1 obtained from conn ..."
Abstract

Cited by 20 (12 self)
 Add to MetaCart
hamiltonian for any f ≥ 1, and that for any f ≥ 0, H0 ⊕ H1 is f +2fault hamiltonianconnected and f +3fault hamiltonian, where H0 = G0 ⊕ G1 and H1 = G2 ⊕ G3. Many interconnection networks such as hypercubelike interconnection networks can be represented in the form of G0 ⊕ G1 connecting two lower
Embedding Starlike Trees into HypercubeLike Interconnection Networks
"... Abstract. A starlike tree (or a quasistar) is a subdivision of a star tree. A family of hypercubelike interconnection networks called restricted HLgraphs includes many interconnection networks proposed in the literature such as twisted cubes, crossed cubes, multiply twisted cubes, Möbius cubes, Mcu ..."
Abstract
 Add to MetaCart
Abstract. A starlike tree (or a quasistar) is a subdivision of a star tree. A family of hypercubelike interconnection networks called restricted HLgraphs includes many interconnection networks proposed in the literature such as twisted cubes, crossed cubes, multiply twisted cubes, Möbius cubes
Paired 2Disjoint Path Covers and Strongly Hamiltonian Laceability of Bipartite HypercubeLike Graphs
, 2013
"... A paired manytomany kdisjoint path cover (paired kDPC for short) of a graph is a set of k vertexdisjoint paths joining k distinct sourcesink pairs that altogether cover every vertex of the graph. We consider the problem of constructing paired 2DPC’s in an mdimensional bipartite HLgraph, Xm, ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
A paired manytomany kdisjoint path cover (paired kDPC for short) of a graph is a set of k vertexdisjoint paths joining k distinct sourcesink pairs that altogether cover every vertex of the graph. We consider the problem of constructing paired 2DPC’s in an mdimensional bipartite HLgraph, Xm
ManytoMany TwoDisjoint Path Covers in Restricted HypercubeLike Graphs
, 2014
"... A Disjoint Path Cover (DPC for short) of a graph is a set of pairwise (internally) disjoint paths that altogether cover every vertex of the graph. Given a set S of k sources and a set T of k sinks, a manytomany kDPC between S and T is a disjoint path cover each of whose paths joins a pair of sou ..."
Abstract
 Add to MetaCart
A Disjoint Path Cover (DPC for short) of a graph is a set of pairwise (internally) disjoint paths that altogether cover every vertex of the graph. Given a set S of k sources and a set T of k sinks, a manytomany kDPC between S and T is a disjoint path cover each of whose paths joins a pair
ManytoMany Disjoint Path Covers in the Presence of Faulty Elements
 IEEE TRANSACTIONS ON COMPUTERS
"... A manytomany kdisjoint path cover (kDPC) of a graph G is a set of k disjoint paths joining k sources and k sinks in which each vertex of G is covered by a path. It is called a paired manytomany disjoint path cover when each source should be joined to a specific sink, and it is called an unpai ..."
Abstract

Cited by 12 (8 self)
 Add to MetaCart
A manytomany kdisjoint path cover (kDPC) of a graph G is a set of k disjoint paths joining k sources and k sinks in which each vertex of G is covered by a path. It is called a paired manytomany disjoint path cover when each source should be joined to a specific sink, and it is called
Panconnectivity and pancyclicity of hypercubelike interconnection networks with faulty elements
 THEORETICAL COMPUTER SCIENCE
, 2007
"... In this paper, we deal with the graph G0 ⊕G1 obtained from merging two graphs G0 and G1 with n vertices each by n pairwise nonadjacent edges joining vertices in G0 and vertices in G1. The main problems studied are how faultpanconnectivity and faultpancyclicity of G0 and G1 are translated into faul ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
into faultpanconnectivity and faultpancyclicity of G0⊕G1, respectively. Many interconnection networks such as hypercubelike interconnection networks can be represented in the form of G0 ⊕ G1 connecting two lower dimensional networks G0 and G1. Applying our results to a class of hypercubelike
Results 1  10
of
142,576