Results 11 to 20 of about 67,481 (208)
Spanning paths in hypercubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Given a family $\{u_i,v_i\}_{i=1}^k$ of pairwise distinct vertices of the $n$-dimensional hypercube $Q_n$ such that the distance of $u_i$ and $v_i$ is odd and $k \leq n-1$, there exists a family $\{P_i\}_{i=1}^k$ of paths such that $u_i$ and $v_i$ are ...
Tomáš Dvořák +2 more
doaj +1 more source
Extended hypercube: a hierarchical interconnection network of hypercubes [PDF]
IEEE Transactions on Parallel and Distributed Systems, 1992 A new interconnection topology-the extended hypercube-consisting of an interconnection network of k-cubes is discussed. The extended hypercube is a hierarchical, expansive, recursive structure with a constant predefined building block. The extended hypercube retains the positive features of the k-cube at different levels of hierarchy and at the same ...
Kumar, Mohan J, Patnaik, LM
openaire +2 more sources
Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes [PDF]
, 1995 Hypercubes, meshes and tori are well known interconnection networks for parallel computers. The sets of edges in those graphs can be partitioned to dimensions.
Bruck, Jehoshua +2 more
core +2 more sources
Set-to-Set Disjoint Path Routing in Bijective Connection Graphs
IEEE Access, 2022 The bijective connection graph encompasses a family of cube-based topologies, and $n$ -dimensional bijective connection graphs include the hypercube and almost all of its variants with the order $2^{n}$ and the degree $n$ .
Keiichi Kaneko +2 more
doaj +1 more source
On regular subgraphs of augmented cubes
AKCE International Journal of Graphs and Combinatorics, 2020 The n-dimensional augmented cube AQn is a variation of the hypercube It is a -regular and -connected graph on vertices. One of the fundamental properties of AQn is that it is pancyclic, that is, it contains a cycle of every length from 3 to In this paper,
Amruta Shinde, Y. M. Borse
doaj +1 more source
Two kinds of conditional connectivity of hypercubes
AKCE International Journal of Graphs and Combinatorics, 2022 A subset [Formula: see text] is called an h-extra r-component cut of G if G – F is disconnected and there are at least r components, each component has at least h + 1 vertices.
Bo Zhu +3 more
doaj +1 more source
A study of the communication cost of the FFT on torus multicomputers [PDF]
, 1995 The computation of a one-dimensional FFT on a c-dimensional torus multicomputer is analyzed. Different approaches are proposed which differ in the way they use the interconnection network. The first approach is based on the multidimensional index mapping
Díaz de Cerio Ripalda, Luis Manuel +2 more
core +1 more source
The line completion number of hypercubes
AKCE International Journal of Graphs and Combinatorics, 2019 In 1992, Bagga, Beineke, and Varma introduced the concept of the super line graph of index of a graph denoted by The vertices of are the -subsets of and two vertices and are adjacent if there exist and such that and are adjacent edges in They also ...
S.A. Tapadia, B.N. Waphare
doaj +1 more source
Embedding Spanning Disjoint Cycles in Hypercube Networks with Prescribed Edges in Each Cycle
Axioms, 2023 One of the important issues in evaluating an interconnection network is to study the hamiltonian cycle embedding problems. A graph G is spanning k-edge-cyclable if for any k independent edges e1,e2,…,ek of G, there exist k vertex-disjoint cycles C1,C2 ...
Weiyan Wu, Eminjan Sabir
doaj +1 more source
Embedding cube-connected cycles graphs into faulty hypercubes [PDF]
, 1994 We consider the problem of embedding a cube-connected cycles graph (CCC) into a hypercube with edge faults. Our main result is an algorithm that, given a list of faulty edges, computes an embedding of the CCC that spans all of the nodes and avoids all of
Bruck, Jehoshua +2 more
core +1 more source