On the local genus distribution of graph embeddings

From MaRDI portal
Publication:4977504

zbMATH Open1371.05128arXiv1601.02574MaRDI QIDQ4977504FDOQ4977504


Authors: Ricky X. F. Chen, Christian M. Reidys Edit this on Wikidata


Publication date: 16 August 2017

Abstract: The 2-cell embeddings of graphs on closed surfaces have been widely studied. It is well known that (2-cell) embedding a given graph G on a closed orientable surface is equivalent to cyclically ordering the edges incident to each vertex of G. In this paper, we study the following problem: given a genus g embedding epsilon of the graph G and a vertex of G, how many different ways of reembedding the vertex such that the resulting embedding epsilon is of genus g+Deltag? We give formulas to compute this quantity and the local minimal genus achieved by reembedding. In the process we obtain miscellaneous results. In particular, if there exists a one-face embedding of G, then the probability of a random embedding of G to be one-face is at least produinV(G)frac2deg(u)+2, where deg(u) denotes the vertex degree of u. Furthermore we obtain an easy-to-check necessary condition for a given embedding of G to be an embedding of minimum genus.


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




Recommendations





Cited In (6)





This page was built for publication: On the local genus distribution of graph embeddings

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