The Incidence Hopf Algebra of Graphs

View/ Open
Issue Date
2012-05-03Author
Humpert, Brandon Eugene
Martin, Jeremy L.
Publisher
Society for Industrial and Applied Mathematics
Type
Article
Article Version
Scholarly/refereed, publisher version
Metadata
Show full item recordAbstract
The graph algebra is a commutative, cocommutative, graded, connected incidence Hopf algebra, whose basis elements correspond to finite 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 Takeuchi's and Schmitt's more general formulas for the antipode in an incidence Hopf algebra. Applications include several formulas (some old and some new) for evaluations of the Tutte polynomial.
Description
This is the published version, also available here: http://dx.doi.org/10.1137/110820075.
Collections
Citation
Humpert, Brandon & Martin, Jeremy L. "The Incidence Hopf Algebra of Graphs." (2012) SIAM J. Discrete Math., 26(2), 555–570. (16 pages). http://dx.doi.org/10.1137/110820075.
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
We want to hear from you! Please share your stories about how Open Access to this item benefits YOU.