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

Hebert Perez-Roses

Abstract


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

Keywords


undirected graphs; graph diameter; degree/diameter problem; Cayley graphs; circulant graphs

Full Text:

PDF

DOI: http://dx.doi.org/10.5614/ejgta.2014.2.2.9

Refbacks

  • There are currently no refbacks.


ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats