Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777682 | Journal of Combinatorial Theory, Series B | 2017 | 25 Pages |
Abstract
In this paper we introduce, and characterize, a class of graph parameters obtained from tensor invariants of the symplectic group. These parameters are similar to partition functions of vertex models, as introduced by de la Harpe and Jones (1993) [5]. Yet they give a completely different class of graph invariants. We moreover show that certain evaluations of the cycle partition polynomial, as defined by Martin (1977) [15], give examples of graph parameters that can be obtained this way.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Guus Regts, Bart Sevenster,