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

Electronic Journal of Graph Theory and Applications

Hebert Perez-Roses¹ 

[1] University of Lleida;

关键词: undirected graphs;    graph diameter;    degree/diameter problem;    cayley graphs;    circulant graphs;   

DOI  :  10.5614/ejgta.2014.2.2.9

来源: DOAJ

【 摘 要 】

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

【 授权许可】

Unknown