Graphs derived from perfect difference sets

2019/03/06 by Grahame Erskine, Erskine, Grahame, Peter Fratrič +3 · 1 citation
Engineering · Mathematics · #05C25 #05C35 #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Limits and Structures in Graph Theory #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1903.02425

openalex publication_date 2019/03/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• Radio gracefulness of Moore graphs and beyond

Related

• A Generalization of Brown's Construction for the Degree/Diameter Problem
• Resolving sets for breaking symmetries of graphs
• Large Cayley graphs of small diameter
• On Word and Gómez Graphs and Their Automorphism Groups in the Degree Diameter Problem
• Cayley graphs of diameter two from difference sets