The Imbedding Sum of a Graph

Details The Imbedding Sum of a Graph The Imbedding Sum of a Graph

2000-02-03

arxiv.org/abs/math/0002021v1

Mathematics

Combinatorics

A 19 page paper with 2 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Imbedding Sum of a Graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Imbedding Sum of a Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Imbedding Sum of a Graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-391088