On the Interlace Polynomials of Forests

Authors

C. Anderson, University of Nebraska
Jonathan Cutler, Montclair State UniversityFollow
A. J. Radcliffe, University of Nebraska
L. Traldi, Lafayette College

Document Type

Article

Publication Date

1-6-2010

Journal / Book Title

Discrete Mathematics

Abstract

The interlace polynomials were introduced by Arratia, Bollobás and Sorkin (2004) [3-5]. These invariants generalize to arbitrary graphs some special properties of the Euler circuits of 2-in, 2-out digraphs. Among many other results, Arratia, Bollobás and Sorkin (2004) [3-5] give explicit formulas for the interlace polynomials of certain types of graphs, including paths; it is natural to wonder whether or not it is possible to extend these formulas to larger classes of graphs. We give a combinatorial description of the interlace polynomials of trees and forests.

Comments

This article is Open Access under an Elsevier User License.

DOI

10.1016/j.disc.2009.07.027

MSU Digital Commons Citation

Anderson, C.; Cutler, Jonathan; Radcliffe, A. J.; and Traldi, L., "On the Interlace Polynomials of Forests" (2010). Department of Mathematics Facuty Scholarship and Creative Works. 124.
https://digitalcommons.montclair.edu/mathsci-facpubs/124

Published Citation

Anderson, C., Cutler, J., Radcliffe, A. J., & Traldi, L. (2010). On the interlace polynomials of forests. Discrete Mathematics, 310(1), 31-36.