Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas

Many graph polynomials, such as the Tutte polynomial, the interlace polynomial and the matching polynomial, have both a recursive definition and a defining subset expansion formula. In this article, we present a general, logic-based framework which gives a precise meaning to recursive definitions of graph polynomials. We then prove in this framework that every recursive definition of a graph polynomial can be converted into a subset expansion formula.

[1]  Robin Wilson,et al.  Modern Graph Theory , 2013 .

[2]  Criel Merino,et al.  Graph Polynomials and Their Applications II: Interrelations and Interpretations , 2008, Structural Analysis of Complex Networks.

[3]  Criel Merino,et al.  Graph Polynomials and Their Applications I: The Tutte Polynomial , 2008, Structural Analysis of Complex Networks.

[4]  Y. Gurevich.  On Finite Model Theory , 1990 .

[5]  Johann A. Makowsky,et al.  From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials , 2008, Theory of Computing Systems.

[6]  Bruno Courcelle.  A multivariate interlace polynomial , 2007, ArXiv.

[7]  A. Dawar.  FINITE MODEL THEORY (Perspectives in Mathematical Logic) , 1997 .

[8]  Johann A. Makowsky,et al.  On Counting Generalized Colorings , 2008, CSL.

[9]  P. Rowlinson.  ALGEBRAIC GRAPH THEORY (Graduate Texts in Mathematics 207) By CHRIS GODSIL and GORDON ROYLE: 439 pp., £30.50, ISBN 0-387-95220-9 (Springer, New York, 2001). , 2002 .

[10]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[11]  Michael Doob,et al.  Spectra of graphs , 1980 .

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

[13]  Fan Chung Graham,et al.  On the Cover Polynomial of a Digraph , 1995, J. Comb. Theory, Ser. B.

[14]  Joanna A. Ellis-Monaghan.  New Results for the Martin Polynomial , 1998, J. Comb. Theory, Ser. B.

[15]  Johann A. Makowsky,et al.  Algorithmic uses of the Feferman-Vaught Theorem , 2004, Ann. Pure Appl. Log..

[16]  Willem H. Haemers,et al.  Spectra of Graphs , 2011 .

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

[18]  Steven D. Noble,et al.  A weighted graph polynomial from chromatic invariants of knots , 1999 .

[19]  Béla Bollobás,et al.  A Two-Variable Interlace Polynomial , 2004, Comb..

[20]  K. Koh,et al.  Chromatic polynomials and chro-maticity of graphs , 2005 .

[21]  Johann A. Makowsky,et al.  From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials , 2006, CiE.

[22]  Johann A. Makowsky,et al.  An extension of the bivariate chromatic polynomial , 2010, Eur. J. Comb..

[23]  Chris D. Godsil,et al.  ALGEBRAIC COMBINATORICS , 2013 .

[24]  Lorenzo Traldi,et al.  On the interlace polynomials , 2010, J. Comb. Theory, Ser. B.

[25]  Alan D. Sokal.  The multivariate Tutte polynomial (alias Potts model) for graphs and matroids , 2005, Surveys in Combinatorics.

[26]  Béla Bollobás,et al.  The interlace polynomial of a graph , 2004, J. Comb. Theory, Ser. B.

[27]  Benedikt Löwe,et al.  Logical Approaches to Computational Barriers: CiE 2006 , 2007, J. Log. Comput..

[28]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

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