• Corpus ID: 119656026

The Imbedding Sum of a Graph

@article{Rieper2000TheIS,
  title={The Imbedding Sum of a Graph},
  author={Robert G. Rieper},
  journal={arXiv: Combinatorics},
  year={2000}
}
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. 

Figures and Tables from this paper

References

SHOWING 1-10 OF 11 REFERENCES

Enumerating the orientable 2-cell imbeddings of complete bipartite graphs

A formula is developed for the number of congruence classes of 2-cell imbeddings of complete bipartite graphs in closed orientable surfaces. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 77–90,

Graphs, Groups and Surfaces

Historical Setting. A Brief Introduction to Graph Theory. The Automorphism Group of a Graph. The Cayley Color Graph of a Group Presentation. An Introduction to Surface Topology. Imbedding Problems in

Enumeration of graph embeddings

Enumerating 2-cell imbeddings of connected graphs

On developpe une approche systematique pour l'enumeration des classes de congruence des plongements 2-cellulaires de graphes connexes sur des 2-varietes orientables closes

Permutation Groups and Combinatorial Structures

The Theory of Group-Reduced Distributions

The Enumeration of Graph Imbeddings

Graphical enumeration

Classification of complete maps on orientable surfaces

  • Rendiconti di Matematica, 4:645–655
  • 1971