Diameter 2 Cayley Graphs of Dihedral Groups
Combinatorics
2015-02-17 v2
Abstract
We consider the degree-diameter problem for Cayley graphs of dihedral groups. We find upper and lower bounds on the maximum number of vertices of such a graph with diameter 2 and degree . We completely determine the asymptotic behaviour of this class of graphs by showing that both limits are asymptotically .
Cite
@article{arxiv.1403.4741,
title = {Diameter 2 Cayley Graphs of Dihedral Groups},
author = {Grahame Erskine},
journal= {arXiv preprint arXiv:1403.4741},
year = {2015}
}
Comments
5 pages; amended to expand remarks