Embedding hypercubes, rings, and odd graphs into hyper-stars

Authors:
Jong-Seok Kim;Eddie Cheng;Laszlo Liptak;Hyeong-Ok Lee
Affiliations:
Department of Computer Science, Oklahoma State University, Stillwater, OK, USA;Department of Mathematics and Statistics, Oakland University, Rochester, MI, USA;Department of Mathematics and Statistics, Oakland University, Rochester, MI, USA;Department of Computer Education, Sunchon National University, Sunchon, Chonnam, South Korea
Venue:
International Journal of Computer Mathematics
Year:
2009

Citing 6
Cited 3

A Study of Odd Graphs as Fault-Tolerant Interconnection Networks

IEEE Transactions on Computers
Introduction to parallel computing: design and analysis of algorithms

Introduction to parallel computing: design and analysis of algorithms
Topological properties of hierarchical cubic networks

Journal of Systems Architecture: the EUROMICRO Journal
Embedding Hierarchical Hypercube Networks into the Hypercube

IEEE Transactions on Parallel and Distributed Systems
Introduction to Parallel Processing: Algorithms and Architectures

Introduction to Parallel Processing: Algorithms and Architectures
Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules

IEEE Transactions on Parallel and Distributed Systems

Optimal Independent Spanning Trees on Odd Graphs

The Journal of Supercomputing
Topological properties of folded hyper-star networks

The Journal of Supercomputing
One-to-many node-disjoint paths of hyper-star networks

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hypercubes and star graphs are two of the most fundamental classes of interconnection networks. The class of hyper-stars was introduced as a hybrid of these two classes. In this note, we establish topological relationship between the hyper-stars and three known classes of networks, namely, hypercubes, tori and odd graphs, via embedding.