Black-white polynomials of graphs and generating functions

TL;DR

This paper explores methods to compute black-white polynomials of graphs using generating functions, with applications in quantum information theory and new constructions for various graph families.

Contribution

It introduces generating function techniques and matrix models to efficiently compute black-white polynomials for different graph classes.

Findings

Rational generating functions for certain graph families.

A matrix model for exponential generating functions of black-white polynomials.

Generalization of Wright's construction for graphs with fixed loop number.

Abstract

Let G be a graph. The black-white polynomial W_G(t) enumerates colorings of the vertices of G with two colors (black and white), where the power of t keeps track of how many white vertices have an even number of black neighbors. Such polynomials appear in quantum information theory, where they are used to capture properties of the entanglement in certain quantum states described by graphs. In this paper we describe how to use generating functions to compute these polynomials for various families X of graphs. Our main results are the following: (i) we describe some constructions under which X leads to a rational generating function; (ii) we use a matrix model to construct the exponential generating function of the black-white polynomials of all graphs; and (iii) we generalize a construction of Wright to build exponential generating functions of black-white polynomials for graphs of a given loop number.