ABSTRACT
G raph embeddings are a subject of study in mathematics and computer science. In oneof the applications, they are mathematical models capturing the issues involved in the implementation of parallel algorithms on a parallel computer. Theoretically too they are significant: they generalize the fundamental concepts of graph isomorphism and subgraph relation. This chapter is a brief report on fundamental problems and their progress with emphasis on embeddings of various computational graphs into hypercubes and variants of hypercubes.
