Large Networks of Diameter Two Based on Cayley Graphs

DOI10.1007/978-3-319-57264-2_23MaRDI QIDQ6265107zbMATH OpenFDO

Publication date 2 September 2015

Full work available at URL https://doi.org/10.1007/978-3-319-57264-2_23

Abstract: In this contribution we present a construction of large networks of diameter two and of order

f r a c 12 d^{2}

for every degree

d g e q 8

, based on Cayley graphs with surprisingly simple underlying groups. For several small degrees we construct Cayley graphs of diameter two and of order greater than

f r a c 23

of Moore bound and we show that Cayley graphs of degrees

d i n 16, 17, 18, 23, 24, 31, d o t s, 35

constructed in this paper are the largest currently known vertex-transitive graphs of diameter two.

This page was built for publication: Large Networks of Diameter Two Based on Cayley Graphs

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