Graphs derived from perfect difference sets
classification
🧮 math.CO
keywords
graphsdifferenceperfectsetsfamilyasymptoticallybrowndegree
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.