Download SARI

ABSTRACT
One of the classical problems in graph theory is the Degree/Diameter Problem. This
problem can be described as follow. For given numbers d and k, construct a graph of
maximum degree d and diameter  k with maximum numbers of vertices nd,k. The natral
general upper bounds for nd,k is the Moore bound.
The Degree/Diameter Problem will be the main issue in this final project, which is how to
construct large graph with given degree and diameter. Voltage assignment is a powerful
tool for such a construction. Many properties of voltage assignment will be studied in this
final project. Properties of the degree and diameter of lifts in connection with the base
graphs will also be discussed.
Large graphs constructed using voltage assignment usually have similar properties with
their base graphs. In this final project we will discuss an interesting property of Cayley
graph, which is the lifts of a Cayley graph will be a Cayley graph as well.