Counting One-Vertex Maps
classification
🧮 math.CO
keywords
mapspre-mapscomputedconsidercountingdependdirecteddistinct
read the original abstract
The number of distinct maps (pre-maps) with a single vertex and valence $d$ is computed for any value of $d$. The types of maps (pre-maps) that we consider depend on whether the underlaying graph (pre-graph) is signed or unsigned and directed or undirected.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.