Graphs derived from perfect difference sets

Erskine, Grahame; Fratrič, Peter and Širáň, Jozef (2021). Graphs derived from perfect difference sets. Australasian Journal of Combinatorics, 80(1) pp. 48–56.

URL: https://ajc.maths.uq.edu.au/?page=get_volumes&volu...

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.

Viewing alternatives

Item Actions

Export

You can export this page using these formats

About

• Item ORO ID
• 75911
• Item Type
• Journal Item
• ISSN
• 2202-3518
• Project Funding Details

• Funded Project Name	Project ID	Funding Body
  Not Set	19-0308	APVV
  Not Set	17-0428	APVV
  Not Set	1/0238/19	VEGA
  Not Set	1/0206/20	VEGA

• Keywords
• degree-diameter problem; difference graphs
• Academic Unit or School
• Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
  Faculty of Science, Technology, Engineering and Mathematics (STEM)
• Copyright Holders
• © 2021 Grahame Erskine, © 2021 Peter Fratrič, © 2021 Jozef Širáň
• Depositing User
• Grahame Erskine