Wide Containers in Gaussian Networks
Discrete Structures and Algorithms (Seminar)
Honours Project Presentation
by Muhammad Adib Surani
Abstract: A Gaussian network is a Cayley graph modelled on a quotient ring of the Gaussian integers. Indeed, many circulant graphs and tori are isomorphic to Gaussian networks, and so this provides a useful algebraic structure with which to study them. Many highly sought after properties in interconnection networks and coding theory (e.g. diameter, shortest paths) can be easily obtained under this framework. The concept of wide containers will also be introduced to unify the properties of connectivity and diameter.