The Imbedding Sum of a Graph
Combinatorics
2007-05-23 v1
Abstract
The automorphisms of a graph act naturally on its set of labeled imbeddings to produce its unlabeled imbeddings. The imbedding sum of a graph is a polynomial that contains useful information about a graph's labeled and unlabeled imbeddings. In particular, the polynomial enumerates the number of different ways the unlabeled imbeddings can be vertex colored and enumerates the labeled and unlabeled imbeddings by their symmetries.
Keywords
Cite
@article{arxiv.math/0002021,
title = {The Imbedding Sum of a Graph},
author = {Robert G. Rieper},
journal= {arXiv preprint arXiv:math/0002021},
year = {2007}
}
Comments
A 19 page paper with 2 figures