Show simple item record

dc.contributor.authorHumpert, Brandon Eugene
dc.contributor.authorMartin, Jeremy L.
dc.date.accessioned2015-03-05T17:17:46Z
dc.date.available2015-03-05T17:17:46Z
dc.date.issued2012-05-03
dc.identifier.citationHumpert, 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.en_US
dc.identifier.urihttp://hdl.handle.net/1808/16971
dc.descriptionThis is the published version, also available here: http://dx.doi.org/10.1137/110820075.en_US
dc.description.abstractThe 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.en_US
dc.publisherSociety for Industrial and Applied Mathematicsen_US
dc.subjectcombinatiorial Hopf algebraen_US
dc.subjectgraphen_US
dc.subjectchromatic polynomialen_US
dc.subjecttutte polynomialen_US
dc.subjectacyclic orientationen_US
dc.titleThe Incidence Hopf Algebra of Graphsen_US
dc.typeArticle
kusw.kuauthorMartin, Jeremy L.
kusw.kudepartmentMathematicsen_US
dc.identifier.doi10.1137/110820075
kusw.oaversionScholarly/refereed, publisher version
kusw.oapolicyThis item meets KU Open Access policy criteria.
dc.rights.accessrightsopenAccess


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record