Counting One-Vertex Maps

Simple item page
dc.creatorOrbanic, Alen
dc.creatorPetkovsek, Marko
dc.creatorPisanski, Tomaz
dc.creatorPotocnik, Primoz
dc.date2008-01-03
dc.date.accessioned2026-07-07T08:52:23Z
dc.date.available2026-07-07T08:52:23Z
dc.descriptionThe 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.
dc.description8 pages, 4 tables
dc.identifierhttps://arxiv.org/abs/0801.0568
dc.identifierhttp://arxiv.org/abs/0801.0568
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/145263
dc.subjectCombinatorics
dc.subject05C30
dc.titleCounting One-Vertex Maps
dc.typetext

Files

Collections

arXiv