Brandon Humpert ; Jeremy L. Martin
-
The Incidence Hopf Algebra of Graphs
dmtcs:2930 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2011,
DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
-
https://doi.org/10.46298/dmtcs.2930
The Incidence Hopf Algebra of GraphsArticle
Authors: Brandon Humpert 1; Jeremy L. Martin 1
NULL##0000-0002-3034-5486
Brandon Humpert;Jeremy L. Martin
1 Department of Mathematics
The graph algebra is a commutative, cocommutative, graded, connected incidence Hopf algebra, whose basis elements correspond to finite simple graphs and whose Hopf product and coproduct admit simple combinatorial descriptions. We give a new formula for the antipode in the graph algebra in terms of acyclic orientations; our formula contains many fewer terms than Schmitt's more general formula for the antipode in an incidence Hopf algebra. Applications include several formulas (some old and some new) for evaluations of the Tutte polynomial.