Date of Award
1993
Document Type
Dissertation
Degree Name
Doctor of Philosophy (PhD)
First Advisor
Said Bettayeb
Abstract
Graph embeddings play an important role in interconnection network and VLSI design. Designing efficient embedding strategies for simulating one network by another and determining the number of layers required to build a VLSI chip are just two of the many areas in which graph embeddings are used. In the area of network simulation we develop efficient, small dilation embeddings of a butterfly network into a different size and/or type of butterfly network. The genus of a graph gives an indication of how many layers are required to build a circuit. We have determined the exact genus for the permutation network called the star graph, and have given a lower bound for the genus of the permutation network called the pancake graph. The star graph has been proposed as an alternative to the binary hypercube and, therefore, we compare the genus of the star graph with that of the binary hypercube. Another type of embedding that is helpful in determining the number of layers is a book embedding. We develop upper and lower bounds on the pagenumber of a book embedding of the k-ary hypercube along with an upper bound on the cumulative pagewidth.
Recommended Citation
Hoelzeman, David Aloys, "Embedding Schemes for Interconnection Networks." (1993). LSU Historical Dissertations and Theses. 5642.
https://repository.lsu.edu/gradschool_disstheses/5642
Pages
107
DOI
10.31390/gradschool_disstheses.5642