The Imbedding Sum of a Graph

Simple item page
dc.creatorRieper, Robert G.
dc.date2000-02-03
dc.date.accessioned2026-07-07T04:33:34Z
dc.date.available2026-07-07T04:33:34Z
dc.descriptionThe 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.
dc.descriptionA 19 page paper with 2 figures
dc.identifierhttps://arxiv.org/abs/math/0002021
dc.identifierhttp://arxiv.org/abs/math/0002021
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/58620
dc.subjectCombinatorics
dc.subject05C30(primary) 05C10(secondary)
dc.titleThe Imbedding Sum of a Graph
dc.typetext

Files

Collections

arXiv