Results 1  10
of
767
Embedding of Meshes on Rotator Graphs
, 1993
"... A set of directed permutation graphs called rotator graphs were proposed as an alternative to the star and pancake graphs for multiprocessor interconnection networks. The rotator graphs have a smaller diameter than star and pancake graphs for the same number of nodes, while sharing the properties of ..."
Abstract
 Add to MetaCart
A set of directed permutation graphs called rotator graphs were proposed as an alternative to the star and pancake graphs for multiprocessor interconnection networks. The rotator graphs have a smaller diameter than star and pancake graphs for the same number of nodes, while sharing the properties
Routing Problems in Incomplete Rotator Graphs
"... Abstract A rotator graph was proposed as a topology for interconnection networks of parallel computers, and it has a merit that it can connect many nodes with small diameter and small degree. However, the number of nodes in a rotator graph must be equal to the factorial of an integer, which causes a ..."
Abstract
 Add to MetaCart
Abstract A rotator graph was proposed as a topology for interconnection networks of parallel computers, and it has a merit that it can connect many nodes with small diameter and small degree. However, the number of nodes in a rotator graph must be equal to the factorial of an integer, which causes
Embedding of Meshes on Rotator Graphs1
"... Abstract A set of directed permutation graphs called rotator graphs were proposed as an alternative to the star and pancake graphs for multiprocessor interconnection networks. The rotator graphs have a smaller diameter than star and pancake graphs for the same number of nodes. while sharing the pr ..."
Abstract
 Add to MetaCart
Abstract A set of directed permutation graphs called rotator graphs were proposed as an alternative to the star and pancake graphs for multiprocessor interconnection networks. The rotator graphs have a smaller diameter than star and pancake graphs for the same number of nodes. while sharing
Hamilton Cycles in Restricted Rotator Graphs
"... The rotator graph has vertices labeled by the permutations of n in one line notation, and there is an arc from u to v if a prefix of u’s label can be rotated to obtain v’s label. In other words, it is the directed Cayley graph whose generators are σk: = (1 2 · · · k) for 2 ≤ k ≤ n and these rotati ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The rotator graph has vertices labeled by the permutations of n in one line notation, and there is an arc from u to v if a prefix of u’s label can be rotated to obtain v’s label. In other words, it is the directed Cayley graph whose generators are σk: = (1 2 · · · k) for 2 ≤ k ≤ n
A Comparative Study of Star Graphs and Rotator Graphs
, 1994
"... Most of the popular interconnection networks can be represented as Cayley graphs. Star graph is one of the extensively studied undirected Cayley graphs, which is considered to be an attractive alternative to the popular binary ncube. The nrotator graph and the cycle prefix digraph are a set of ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Most of the popular interconnection networks can be represented as Cayley graphs. Star graph is one of the extensively studied undirected Cayley graphs, which is considered to be an attractive alternative to the popular binary ncube. The nrotator graph and the cycle prefix digraph are a set
Hamilton Cycles in Restricted and Incomplete Rotator Graphs
, 2012
"... The nodes of a rotator graph are the permutations of n, and an arc is directed from u to v if the first r symbols of u can be rotated one position to the left to obtain v. Restricted rotator graphs restrict the allowable rotations to r ∈ R for some R ⊆ {2, 3,..., n}. Incomplete rotator graphs only i ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The nodes of a rotator graph are the permutations of n, and an arc is directed from u to v if the first r symbols of u can be rotated one position to the left to obtain v. Restricted rotator graphs restrict the allowable rotations to r ∈ R for some R ⊆ {2, 3,..., n}. Incomplete rotator graphs only
On the Diameter of the Rotation Graph of Binary Coupling Trees
, 1999
"... A binary coupling tree on n+1 leaves is a 02tree in which each leaf has a distinct label. The rotation graph Gn is defined as the graph of all binary coupling trees on n + 1 leaves, with edges connecting trees that can be transformed into each other by a single rotation. In this paper we study d ..."
Abstract
 Add to MetaCart
A binary coupling tree on n+1 leaves is a 02tree in which each leaf has a distinct label. The rotation graph Gn is defined as the graph of all binary coupling trees on n + 1 leaves, with edges connecting trees that can be transformed into each other by a single rotation. In this paper we study
The Rotation Graph of kary Trees is Hamiltonian
, 2006
"... In this paper we show that the graph of kary trees, connected by rotations, contains a Hamilton cycle. Our proof is constructive and thus provides a cyclic Gray code for kary trees. Furthermore, we identify a basic building block of this graph as the 1skeleton of the polytopal complex dual to the ..."
Abstract
 Add to MetaCart
In this paper we show that the graph of kary trees, connected by rotations, contains a Hamilton cycle. Our proof is constructive and thus provides a cyclic Gray code for kary trees. Furthermore, we identify a basic building block of this graph as the 1skeleton of the polytopal complex dual
Results 1  10
of
767