A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Network structures and algorithms for large multiprocessors
Network structures and algorithms for large multiprocessors
RH: A Versatile Family of Reduced Hypercube Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Routing and Embeddings in Super Cayley Graphs
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
Node-to-Set Disjoint Paths Problem in Rotator Graphs
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
A Comparative Study of Star Graphs and Rotator Graphs
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Journal of Systems Architecture: the EUROMICRO Journal
On the Surface Area of the (n, k)-Star Graph
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Loopless generation of multiset permutations using a constant number of variables by prefix shifts
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
An efficient algorithm for minimum feedback vertex sets in rotator graphs
Information Processing Letters
The Container Problem in Bubble-Sort Graphs
IEICE - Transactions on Information and Systems
On the surface area of the (n,k)-star graph
Theoretical Computer Science
Distance formula and shortest paths for the (n,k)-star graphs
Information Sciences: an International Journal
Embedding algorithms for bubble-sort, macro-star, and transposition graphs
NPC'10 Proceedings of the 2010 IFIP international conference on Network and parallel computing
Node-disjoint paths in hierarchical hypercube networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Set-to-set disjoint-paths routing in recursive dual-net
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
Container problem in burnt pancake graphs
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Container problem in bi-rotator graphs
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Generating combinations by prefix shifts
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Feedback vertex sets in rotator graphs
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
Node-to-Set disjoint paths problem in bi-rotator graphs
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Hamilton cycles in restricted rotator graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Embedding algorithms for star, bubble-sort, rotator-faber-moore, and pancake graphs
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Some properties of WK-recursive and swapped networks
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
The greedy gray code algorithm
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
Rotator graphs, a set of directed permutation graphs, are proposed as an alternative to star and pancake graphs. Rotator graphs are defined in a way similar to the recently proposed Faber-Moore graphs. They have smaller diameter, n-1 in a graph with n factorial vertices, than either the star or pancake graphs or the k-ary n-cubes. A simple optimal routing algorithm is presented for rotator graphs. The n-rotator graphs are defined as a subset of all rotator graphs. The distribution of distances of vertices in the n-rotator graphs is presented, and the average distance between vertices is found. The n-rotator graphs are shown to be optimally fault tolerant and maximally one-step fault diagnosable. The n-rotator graphs are shown to be Hamiltonian, and an algorithm for finding a Hamiltonian circuit in the graphs is given.