Large butterfly Cayley graphs and digraphs

From MaRDI portal
Publication:2012530

DOI10.1016/J.DISC.2017.05.012zbMATH Open1367.05099arXiv1507.08926OpenAlexW2614397974MaRDI QIDQ2012530FDOQ2012530


Authors: David Bevan Edit this on Wikidata


Publication date: 1 August 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: We present families of large undirected and directed Cayley graphs whose construction is related to butterfly networks. One approach yields, for every large k and for values of d taken from a large interval, the largest known Cayley graphs and digraphs of diameter k and degree d. Another method yields, for sufficiently large k and infinitely many values of d, Cayley graphs and digraphs of diameter k and degree d whose order is exponentially larger in k than any previously constructed. In the directed case, these are within a linear factor in k of the Moore bound.


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




Recommendations




Cites Work


Cited In (9)





This page was built for publication: Large butterfly Cayley graphs and digraphs

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