ISSN:
1572-9125
Keywords:
C.1.2
;
G.2.2
;
Boolean cube
;
graphs
;
embedding of graphs
;
interconnection networks
;
mesh of trees
;
tree of meshes
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract In this paper, we characterize a class of graphs which can be embedded on a boolean cube. Some of the graphs in this class are identified with the well known graphs such asmulti-dimensional mesh of trees, tree of meshes, etc. We suggest (i) an embedding of anr-dimensional mesh of trees ofn r (r+1)−rn r−1 nodes on a boolean cube of (2n) r nodes, and (ii) an embedding of a tree of meshes with 2n 2 logn+n 2 nodes on a boolean cube withn 2 exp2 (log (2 logn+1)]) nodes.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02017346
Permalink