scientific article; zbMATH DE number 1789783
From MaRDI portal
Publication:4549088
The genus distribution of a connected graph \(G\) is a sequence \(g_0,g_1,\dots,g_i,\dots\) such that \(g_i\) is the number of different \(2\)-cell embeddings of \(G\) in the orientable surface of genus \(i\). Two embeddings are defined to be different if the corresponding rotations are distinct. By using the idea of semirelative embeddings (those where parts of face boundaries are predetermined) the author derives the genus distribution of the circular ladder graph---the Cartesian product of the \(n\)-cycle with the complete graph of order \(2\).
Recommendations
Cited in
(17)- Genus distributions for bouquets of circles
- Genus distribution of Ringel ladders
- Enumerating reflexible 2-cell embeddings of connected graphs
- Genus distributions for several types of ladder-class graphs
- The genus distributions for a certain type of permutation graphs in orientable surfaces
- The semi-arc automorphism group of a graph with application to map enumeration
- Genera of Cayley maps
- Genus from sandpile torsor algorithm
- Total embedding distributions of circular ladders
- The average genus for bouquets of circles and dipoles
- Log-concavity of genus distributions for circular ladders
- Embeddings of circular graphs
- Total embedding distributions of Ringel ladders
- scientific article; zbMATH DE number 2164059 (Why is no real title available?)
- scientific article; zbMATH DE number 5584119 (Why is no real title available?)
- Genus distribution for circle-like graph
- Embeddings of circular ladder-like graph families
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4549088)