Graphs derived from perfect difference sets
Combinatorics
2019-03-07 v1
Abstract
We study a family of graphs with diameter two and asymptotically optimal order for their maximum degree, obtained from perfect difference sets. We show that for all known examples of perfect difference sets, the graph we obtain is isomorphic to one of the Brown graphs, a well-known family of graphs in the degree-diameter problem.
Keywords
Cite
@article{arxiv.1903.02425,
title = {Graphs derived from perfect difference sets},
author = {Grahame Erskine and Peter Fratrič and Jozef Širáň},
journal= {arXiv preprint arXiv:1903.02425},
year = {2019}
}
Comments
8 pages