Large butterfly Cayley graphs and digraphs
David Bevan

TL;DR
This paper introduces new large Cayley graphs and digraphs inspired by butterfly networks, achieving record sizes for given diameter and degree, and approaching theoretical bounds.
Contribution
It presents novel constructions of Cayley graphs and digraphs with maximal order for specified diameter and degree, improving on previous bounds.
Findings
Largest known Cayley graphs and digraphs for certain parameters
Construction methods related to butterfly networks
Graphs approaching Moore bound in directed case
Abstract
We present families of large undirected and directed Cayley graphs whose construction is related to butterfly networks. One approach yields, for every large and for values of taken from a large interval, the largest known Cayley graphs and digraphs of diameter and degree . Another method yields, for sufficiently large and infinitely many values of , Cayley graphs and digraphs of diameter and degree whose order is exponentially larger in than any previously constructed. In the directed case, these are within a linear factor in of the Moore bound.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Advanced Graph Theory Research · graph theory and CDMA systems
