Counting One-Vertex Maps

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
8 pages, 4 tables

Keywords

Combinatorics, 05C30

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/145263

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0801.0568
 http://arxiv.org/abs/0801.0568

Collections

arXiv