Graphs derived from perfect difference sets

From MaRDI portal
Publication:5000288




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 page was built for publication: Graphs derived from perfect difference sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000288)