Add to ORKG[[abstract]]In this paper, we consider two embedding problems in Cartesian product networks: one is the pancycle problem, which involves embedding cycles of various lengths in the given product network; and the other is the panconnectivity problem, which involves embedding paths of various lengths between any pair of distinct nodes in the given product network. We then apply our technical lemmas and theorems to derive new topological properties of two multiprocessor systems, namely, generalized hypercubes and nearest neighbor mesh hypercubes.[[note]]SC
Many well-known interconnection networks, such as kary n-cubes, recursive circulant graphs, generali...
AbstractIn this paper, we consider graphs modeling interconnection networks of parallel systems and ...
This article attempts to discuss the problems in building new topologies utilizing embedding. We pro...
[[abstract]]In this paper, we consider two embedding problems in Cartesian product networks: one is ...
To find a cycle (resp. path) of a given length in a graph is the cycle (resp. path) embedding proble...
Graph embedding is a powerful method in parallel computing that maps a guest network G into a host n...
Abstract A graph G of order n (≥2) is said to be panconnected if for each pair (x, y) of vertices of...
We present a uniform mathematical characterization of interconnection network classes referred to as...
AbstractWe prove exact results on dilations in cycles for important parallel computer interconnectio...
In recent times the use of star and pancake networks as a viable interconnection scheme for parallel...
[[abstract]]An incomplete hypercube is a generalization of the hypercube in the sense that the numbe...
AbstractIn this paper, we study containment properties of graphs in relation with the Cartesian prod...
[[abstract]]Abstract澤 Cartesian product network is obtained by applying the cross operation on two g...
In this paper, a method for constructing node-disjoint (parallel) paths in k-ary n-cube interconnect...
[[abstract]]A Cartesian product network is obtained by applying the cross operation on two graphs. I...
Many well-known interconnection networks, such as kary n-cubes, recursive circulant graphs, generali...
AbstractIn this paper, we consider graphs modeling interconnection networks of parallel systems and ...
This article attempts to discuss the problems in building new topologies utilizing embedding. We pro...
[[abstract]]In this paper, we consider two embedding problems in Cartesian product networks: one is ...
To find a cycle (resp. path) of a given length in a graph is the cycle (resp. path) embedding proble...
Graph embedding is a powerful method in parallel computing that maps a guest network G into a host n...
Abstract A graph G of order n (≥2) is said to be panconnected if for each pair (x, y) of vertices of...
We present a uniform mathematical characterization of interconnection network classes referred to as...
AbstractWe prove exact results on dilations in cycles for important parallel computer interconnectio...
In recent times the use of star and pancake networks as a viable interconnection scheme for parallel...
[[abstract]]An incomplete hypercube is a generalization of the hypercube in the sense that the numbe...
AbstractIn this paper, we study containment properties of graphs in relation with the Cartesian prod...
[[abstract]]Abstract澤 Cartesian product network is obtained by applying the cross operation on two g...
In this paper, a method for constructing node-disjoint (parallel) paths in k-ary n-cube interconnect...
[[abstract]]A Cartesian product network is obtained by applying the cross operation on two graphs. I...
Many well-known interconnection networks, such as kary n-cubes, recursive circulant graphs, generali...
AbstractIn this paper, we consider graphs modeling interconnection networks of parallel systems and ...
This article attempts to discuss the problems in building new topologies utilizing embedding. We pro...