The Imbedding Sum of a Graph
Robert G. Rieper
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.
Create a lesson
Related papers
Cones of Theta Graphs are Enumeratively Chromatic-Choosable
Kingston Barnes, Vincent Fesenmeier, Braxton Gaither et al.
Polynomial Identities for Generalized Fibonacci Sequences
Joey Glampe, Aryaman Joshi, Swagat Malla et al.
Davenport Constants of Finite Abelian Groups
Dongchun Han, Hanbin Zhang
How iterated sumsets grow under the assumption of small doubling
Dongchun Han, Qinghai Zhong
Sharp lower bounds for bisections of graphs with bounded maximum degree
Qiwen Guo, Gregory Gutin
Hilbert functions over the exterior algebra and f-vectors in higher rank II: Generalizing Linusson's count to sumsets of f-vectors
Jan Snellman