Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey

Hebert Perez-Roses
2014 Electronic Journal of Graph Theory and Applications  
This paper discusses the most popular algebraic techniques and computational methods that have been used to construct large undirected graphs with given degree and diameter. Problem 1 (Degree/Diameter problem for undirected graphs). Given positive integers ∆ and D, find the largest possible number of vertices N ∆,D of a graph of maximum degree ∆ and diameter D. It is easy to show that an upper bound for N ∆,D is
doi:10.5614/ejgta.2014.2.2.9 fatcat:e57fyrwwojao3aayms3r2yz73y