Results 1  10
of
178,960
On the critical group of the ncube
 LINEAR ALGEBRA AND ITS APPLICATIONS
, 2003
"... Reiner proposed two conjectures about the structure of the critical group of the ncube Qn. In this paper we confirm them. Furthermore we describe its pprimary structure for all odd primes p. The results are generalized to Cartesian product of complete graphs Kn1 ×···× Knk by Jacobson, Niedermaier ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Reiner proposed two conjectures about the structure of the critical group of the ncube Qn. In this paper we confirm them. Furthermore we describe its pprimary structure for all odd primes p. The results are generalized to Cartesian product of complete graphs Kn1 ×···× Knk by Jacobson, Niedermaier
Forwardingindices of folded ncubes �
"... For a given connected graph G of order n, a routing R is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forwarding index of a graph is the maximum number of paths of R passingthrough any vertex (resp. edge) in the graph. In this paper, t ..."
Abstract
 Add to MetaCart
, the authors determine the vertex and the edge forwarding indices of a folded ncube as (n − 1)2n−1 � � n + 1 − ((n + 1)/2) n+1 and 2
PATH BUNDLES ON nCUBES
"... Abstract. A path bundle is a set of 2 a paths in an ncube, denoted Qn, such that every path has the same length, the paths partition the vertices of Qn, the endpoints of the paths induce two subcubes of Qn, and the endpoints of each path are complements. This paper shows that a path bundle exists i ..."
Abstract
 Add to MetaCart
Abstract. A path bundle is a set of 2 a paths in an ncube, denoted Qn, such that every path has the same length, the paths partition the vertices of Qn, the endpoints of the paths induce two subcubes of Qn, and the endpoints of each path are complements. This paper shows that a path bundle exists
EVOLUTION OF THE nCUBE
, 1979
"... Let C ” denote the graph with vertices @I,. . . ,e,,) , ei = 0,i and vertices adjacent if they differ in exactly one coordinate. We call C ” the ncube. Let G = G., denote the random subgraph of C ” defined by letting Prob(IijlEG)=p for ah & jE CR and letting these probabilities be mutually ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
Let C ” denote the graph with vertices @I,. . . ,e,,) , ei = 0,i and vertices adjacent if they differ in exactly one coordinate. We call C ” the ncube. Let G = G., denote the random subgraph of C ” defined by letting Prob(IijlEG)=p for ah & jE CR and letting these probabilities be mutually
FFT Implementations on nCUBE Multiprocessor
"... Three parallel FFT algorithms have been implemented on nCUBE multiprocessor and their performance have been analyzed. We have also developed a communication and computation model for the nCUBE system based on measurements. This model is then used to predict the execution time and communication time ..."
Abstract
 Add to MetaCart
Three parallel FFT algorithms have been implemented on nCUBE multiprocessor and their performance have been analyzed. We have also developed a communication and computation model for the nCUBE system based on measurements. This model is then used to predict the execution time and communication time
Skeletons of Some Relatives of the NCube
, 1994
"... We study the skeleton of several polytopes related to the ncube, the halved ncube, and the folded ncube. In particular, the Gale polytope of the ncube, its dual and the duals of the halved ncube and the complete bipartite subgraphs polytope. 1 Introduction The general references are [?, ?, ..."
Abstract
 Add to MetaCart
We study the skeleton of several polytopes related to the ncube, the halved ncube, and the folded ncube. In particular, the Gale polytope of the ncube, its dual and the duals of the halved ncube and the complete bipartite subgraphs polytope. 1 Introduction The general references
On kPartitioning the nCube
 In 26th International Workshop, WG 1996, LNCS 1197
, 1996
"... . Let an edge cut partition the vertex set of the ncube into k subsets A1 ; :::; Ak with jjA i j \Gamma jA j jj 1. We consider the problem to determine minimal size of such a cut and present its asymptotic as n; k !1 and also as n !1 and k is a constant of the form k = 2 a \Sigma 2 b with a ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
. Let an edge cut partition the vertex set of the ncube into k subsets A1 ; :::; Ak with jjA i j \Gamma jA j jj 1. We consider the problem to determine minimal size of such a cut and present its asymptotic as n; k !1 and also as n !1 and k is a constant of the form k = 2 a \Sigma 2 b with a
Augmented kary ncubes
 Information Sciences
"... We define an interconnection network AQn,k which we call the augmented kary ncube by extending a kary ncube in a manner analogous to the existing extension of an ndimensional hypercube to an ndimensional augmented cube. We prove that the augmented kary ncube AQn,k has a number of attractive ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We define an interconnection network AQn,k which we call the augmented kary ncube by extending a kary ncube in a manner analogous to the existing extension of an ndimensional hypercube to an ndimensional augmented cube. We prove that the augmented kary ncube AQn,k has a number of attractive
Cosimplicial objects and little ncubes
 I. Amer. J. Math
"... In this paper we show that if a cosimplicial space has a certain kind of combinatorial structure then its total space has an action of an operad weakly equivalent to the little ncubes operad. Our results are also valid for cosimplicial spectra. 1 Introduction. The little ncubes operad Cn was intro ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
In this paper we show that if a cosimplicial space has a certain kind of combinatorial structure then its total space has an action of an operad weakly equivalent to the little ncubes operad. Our results are also valid for cosimplicial spectra. 1 Introduction. The little ncubes operad Cn
Results 1  10
of
178,960