The Imbedding Sum of a Graph
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.
 Publication:

arXiv Mathematics eprints
 Pub Date:
 February 2000
 arXiv:
 arXiv:math/0002021
 Bibcode:
 2000math......2021R
 Keywords:

 Combinatorics;
 05C30(primary) 05C10(secondary)
 EPrint:
 A 19 page paper with 2 figures