Cayley graphs of diameter two with order greater than 0.684 of the Moore bound for any degree
arXiv:1511.03706 · doi:10.1016/j.ejc.2016.04.008
Abstract
It is known that the number of vertices of a graph of diameter two cannot exceed . In this contribution we give a new lower bound for orders of Cayley graphs of diameter two in the form valid for all degrees . The result is a significant improvement of currently known results on the orders of Cayley graphs of diameter two.
14 pages, 2 tables, Published in European Journal of Combinatorics. Free access to the article valid until July 9, 2016: http://authors.elsevier.com/a/1T3zuiVNjvDA6