Skip to main content
Article thumbnail
Location of Repository

A two-variable interlace polynomial

By Richard Arratia, Béla Bollobás and Gregory B. Sorkin


We introduce a new graph polynomial in two variables. This ldquointerlacerdquo polynomial can be computed in two very different ways. The first is an expansion analogous to the state space expansion of the Tutte polynomial; the significant differences are that our expansion is over vertex rather than edge subsets, and the rank and nullity employed are those of an adjacency matrix rather than an incidence matrix. The second computation is by a three-term reduction formula involving a graph pivot; the pivot arose previously in the study of interlacement and Euler circuits in four-regular graphs. We consider a few properties and specializations of the two-variable interlace polynomial. One specialization, the ldquovertex-nullity interlace polynomialrdquo, is the single-variable interlace graph polynomial we studied previously, closely related to the Tutte–Martin polynomial on isotropic systems previously considered by Bouchet. Another, the ldquovertex-rank interlace polynomialrdquo, is equally interesting. Yet another specialization of the two-variable polynomial is the independent-set polynomial

Topics: QA Mathematics
Publisher: Springer
Year: 2004
DOI identifier: 10.1007/s00493-004-0035-6
OAI identifier:
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.