In this contribution we present a construction of large networks of diameter two and of order ½ d2 for every degree d ≥ 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 2/3 of Moore bound and we show that Cayley graphs of degrees d ∈{16, 17, 18, 23, 24, 31,…,35} constructed in this paper are the largest currently known vertex-transitive graphs of diameter two.
CITATION STYLE
Abas, M. (2017). Large networks of diameter two based on cayley graphs. In Advances in Intelligent Systems and Computing (Vol. 574, pp. 225–233). Springer Verlag. https://doi.org/10.1007/978-3-319-57264-2_23
Mendeley helps you to discover research relevant for your work.