Graphs derived from perfect difference sets
From MaRDI portal
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.
Recommendations
Cites work
- A Theorem in Finite Projective Geometry and Some Applications to Number Theory
- scientific article; zbMATH DE number 1101474 (Why is no real title available?)
- Maximum degree in graphs of diameter 2
- On Graphs that do not Contain a Thomsen Graph
- On Moore Graphs with Diameters 2 and 3
- ON PERFECT DIFFERENCE SETS
- Polarity graphs revisited
- Primitive finite field elements with prescribed trace
- Search for properties of the missing Moore graph
Cited in
(6)- Graphs of vectorial plateaued functions as difference sets
- scientific article; zbMATH DE number 5942287 (Why is no real title available?)
- scientific article; zbMATH DE number 2040944 (Why is no real title available?)
- Dirichlet character difference graphs
- Difference graphs
- On bipartite biregular large graphs derived from difference sets
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)