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

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

This paper discusses the most popular algebraic techniques and computational methods that have been used to construct large graphs with given degree and diameter.

Bibliographic Details
Main Author: Hebert Perez-Roses
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2014-10-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
undirected graphs
graph diameter
degree/diameter problem
cayley graphs
circulant graphs
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/96

Internet

https://www.ejgta.org/index.php/ejgta/article/view/96

Similar Items