Fault-tolerant embedding of complete binary trees in hypercubes

1993 ◽  
Vol 4 (3) ◽  
pp. 277-288 ◽  
Author(s):  
M.Y. Chan ◽  
S.-J. Lee
Keyword(s):  
Fault Tolerant ◽  
Binary Trees

Fault-tolerant embedding of complete binary trees in locally twisted cubes

2017 ◽  
Vol 101 ◽  
pp. 69-78 ◽  
Author(s):  
Zhao Liu ◽  
Jianxi Fan ◽  
Jingya Zhou ◽  
Baolei Cheng ◽  
Xiaohua Jia
Keyword(s):  
Fault Tolerant ◽  
Binary Trees ◽  
Locally Twisted Cubes ◽  
Twisted Cubes

ANALYSIS OF A CLASS OF NETWORKS BASED ON CUBIC STAR GRAPHS

1994 ◽  
Vol 04 (02) ◽  
pp. 191-222
Author(s):  
S.V.R. MADABHUSHI ◽  
S. LAKSHMIVARAHAN ◽  
S.K. DHALL
Keyword(s):  
Interconnection Networks ◽  
Fault Tolerant ◽  
Cayley Graphs ◽  
Binary Trees ◽  
Star Graph ◽  
Cubic Graphs ◽  
Topological Properties ◽  
Star Graphs ◽  
New Class ◽  
Edge Transitive

A new class of interconnection networks based on a family of graphs, called cubic graphs are introduced. These latter graphs arise as Cayley graphs of certain subgroups of the symmetric group. It turns out that these Cayley graphs are a hybrid between the binary hypercube and the star graph, and hence are called cubic star graphs, and are denoted by CS(m, n), m≥1 and n≥1. CS(m, n) inherits several of the properties of the hypercube and the star graph. In this paper, we present an analysis of the symmetric and topological properties. In particular, it is shown that CS(m, n) is edge transitive and hence maximally fault tolerant. We give an algorithm for finding the shortest path and provide an enumeration of the node disjoint paths. Optimal algorithms for single source and all-source broadcasting (also called gossiping) are derived. It is shown that CS(m, n) is Hamiltonian and interesting embeddings of several cycles, grids, and binary trees are derived. The paper concludes with a comparison of CS(m, n) with the binary hypercube and the star graph.

A Fault-Tolerant Modular Architecture for Binary Trees

1986 ◽  
Vol C-35 (4) ◽  
pp. 356-361 ◽  
Author(s):  
Mahmudul Hassan ◽  
Agarwal
Keyword(s):  
Fault Tolerant ◽  
Binary Trees ◽  
Modular Architecture
Sign in / Sign up

Export Citation Format

Share Document