2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/145263The 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.8 pages, 4 tablesCombinatorics05C30text