English

Counting One-Vertex Maps

Combinatorics 2008-01-04 v1

Abstract

The number of distinct maps (pre-maps) with a single vertex and valence dd is computed for any value of dd. 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.

Keywords

Cite

@article{arxiv.0801.0568,
  title  = {Counting One-Vertex Maps},
  author = {Alen Orbanic and Marko Petkovsek and Tomaz Pisanski and Primoz Potocnik},
  journal= {arXiv preprint arXiv:0801.0568},
  year   = {2008}
}

Comments

8 pages, 4 tables

R2 v1 2026-06-21T09:59:22.460Z