2008/01/03 by Alen Orbanić, Alen Orbanic, Orbanic, Alen +9
Computer Science · Mathematics · #05C30 #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #Data Management and Algorithms #FOS: Mathematics #math.CO #msc:05C30
paper · pdf · doi:10.48550/arxiv.0801.0568
8 pages, 4 tables
arxiv created 2008/01/03 · openalex publication_date 2008/01/03 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.