Total embedding distributions for bouquets of circles (Q1598817): Difference between revisions

For a graph \(G\), let \(s_0(n)\) (\(s_1(n)\)) denote the number of nonequivalent 2-cell embeddings of \(G\) in the orientable (nonorientable) surface of genus \(n\). The generating function \(g_0(z)\) for the numbers \(s_0(n)\) (\(n\geq 0\)) is called the genus polynomial. Similarly, one defines the generating function \(g_1(z)\) of the sequence \(s_1(n)\) (\(n\geq 1\)) and the multivariate generating function which counts nonequivalent 2-cell embeddings with the same face size distribution. These functions are determined for bouquets (graphs with one vertex and \(m\) loops) and for dipoles (graphs on two vertices joined by \(m\) edges). The computations are done by using an edge-attaching surgery technique which is different from more algebraic techniques used in a related earlier work by \textit{J. Chen, J. L. Gross}, and \textit{R. G. Rieper} [Overlap matrices and total imbedding distributions, Discrete Math. 128, 73-94 (1994; Zbl 0798.05017)].