A Most General Edge Elimination Polynomial

  • Authors:

  • Ilia Averbouch;Benny Godlin;Johann A. Makowsky

  • Affiliations:

  • Faculty of Computer Science, Israel Institute of Technology, Haifa, Israel;Faculty of Computer Science, Israel Institute of Technology, Haifa, Israel;Faculty of Computer Science, Israel Institute of Technology, Haifa, Israel

  • Venue:
  • Graph-Theoretic Concepts in Computer Science
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We look for graph polynomials which satisfy recurrence relations on three kinds of edge elimination: edge deletion, edge contraction and edge extraction, i.e., deletion of edges together with their end points. Like in the case of deletion and contraction only (J.G. Oxley and D.J.A. Welsh 1979), it turns out that there is a most general polynomial satisfying such recurrence relations, which we call *** (G ,x ,y ,z ). We show that the new polynomial simultaneously generalizes the Tutte polynomial, the matching polynomial, and the recent generalization of the chromatic polynomial proposed by K.Dohmen, A.Pönitz and P.Tittman (2003), including also the independent set polynomial of I. Gutman and F. Harary, (1983) and the vertex-cover polynomial of F.M. Dong, M.D. Hendy, K.T. Teo and C.H.C. Little (2002). We give three definitions of the new polynomial: first, the most general recursive definition, second, an explicit one, using a set expansion formula, and finally, a partition function, using counting of weighted graph homomorphisms. We prove the equivalence of the three definitions. Finally, we discuss the complexity of computing *** (G ,x ,y ,z ).