Parametrized Tutte Polynomials of Graphs and Matroids

We generalize and unify results on parametrized and coloured Tutte polynomials of graphs and matroids due to Zaslavsky, and Bollobas and Riordan. We give a generalized Zaslavsky–Bollobas–Riordan theorem that characterizes parametrized contraction–deletion functions on minor-closed classes of matroids, as well as the modifications necessary to apply the discussion to classes of graphs. In general, these parametrized Tutte polynomials do not satisfy analogues of all the familiar properties of the classical Tutte polynomial. We give conditions under which they do satisfy corank-nullity formulas, and also conditions under which they reflect the structure of series-parallel connections.

[1]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[2]  Lorenzo Traldi,et al.  Parallel connections and coloured Tutte polynomials , 2005, Discret. Math..

[3]  Thomas Zaslavsky,et al.  Strong Tutte functions of matroids and graphs , 1992 .

[4]  Béla Bollobás,et al.  A Tutte Polynomial for Coloured Graphs , 1999 .

[5]  N. White.  Theory of Matroids , 2008 .

[6]  James G. Oxley,et al.  Matroid theory , 1992 .

[7]  Béla Bollobás,et al.  A Tutte Polynomial for Coloured Graphs , 1999, Combinatorics, Probability and Computing.

[8]  Lorenzo Traldi,et al.  A Subset Expansion of the Coloured Tutte Polynomial , 2004, Combinatorics, Probability and Computing.

[9]  Lorenzo Traldi,et al.  A dichromatic polynomial for weighted graphs and link polynomials , 1989 .

[10]  Frank Harary,et al.  Graph Theory , 2016 .

[11]  John W. Essam,et al.  Graph theory and statistical physics , 1971, Discret. Math..

[12]  Gary Gordon,et al.  Generalized activities and the tutte polynomial , 1990, Discret. Math..

[13]  Douglas R. Woodall.  Tutte polynomial expansions for 2-separable graphs , 2002, Discret. Math..

[14]  James G. Oxley,et al.  Tutte polynomials computable in polynomial time , 1992, Discret. Math..

[15]  C. Fortuin,et al.  On the random-cluster model: I. Introduction and relation to other models , 1972 .

[16]  D. Welsh.  Complexity: Knots, Colourings and Counting: Link polynomials and the Tait conjectures , 1993 .

[17]  Tom Brylawski,et al.  A combinatorial model for series-parallel networks , 1971 .

[18]  Ronald C. Read,et al.  Chromatic polynomials of homeomorphism classes of graphs , 1999, Discret. Math..

[19]  Lorenzo Traldi.  Generalized activities and reliability , 2004 .