Constructions of large graphs on surfaces

From MaRDI portal
(Redirected from Publication:742602)



Abstract: We consider the degree/diameter problem for graphs embedded in a surface, namely, given a surface Sigma and integers Delta and k, determine the maximum order N(Delta,k,Sigma) of a graph embeddable in Sigma with maximum degree Delta and diameter k. We introduce a number of constructions which produce many new largest known planar and toroidal graphs. We record all these graphs in the available tables of largest known graphs. Given a surface Sigma of Euler genus g and an odd diameter k, the current best asymptotic lower bound for N(Delta,k,Sigma) is given by [sqrt{frac{3}{8}g}Delta^{lfloor k/2 floor}.] Our constructions produce new graphs of order [�egin{cases}6Delta^{lfloor k/2 floor}& ext{if Sigma is the Klein bottle}\ (frac{7}{2}+sqrt{6g+frac{1}{4}})Delta^{lfloor k/2 floor}& ext{otherwise,}end{cases}] thus improving the former value by a factor of 4.












This page was built for publication: Constructions of large graphs on surfaces

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