Graphs derived from perfect difference sets

zbMATH Open1468.05246arXiv1903.02425MaRDI QIDQ5000288FDOQ5000288

Jozef Širáň, Grahame Erskine, Peter Fratrič

Publication date: 12 July 2021

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.

Full work available at URL: https://arxiv.org/abs/1903.02425

zbMATH Keywords

degree-diameter problemBrown graphs

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Distance in graphs (05C12) Structural characterization of families of graphs (05C75)

Cites Work

• Title not available (Why is that?)
• A Theorem in Finite Projective Geometry and Some Applications to Number Theory
• On Graphs that do not Contain a Thomsen Graph
• On Moore Graphs with Diameters 2 and 3
• Maximum degree in graphs of diameter 2
• Search for properties of the missing Moore graph
• ON PERFECT DIFFERENCE SETS
• Primitive finite field elements with prescribed trace
• Polarity graphs revisited

Cited In (4)

• Difference graphs
• Title not available (Why is that?)
• Graphs of vectorial plateaued functions as difference sets
• Title not available (Why is that?)

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)