A Characterization of Trees with Trinomial Partial Petrial Polynomials

Abstract

The partial Petrial polynomial of a bouquet can be computed from the coranks over GF(2) of matrices obtained by varying the diagonal entries of the adjacency matrix of its intersection graph. Motivated by this matrix formulation, we study the corresponding polynomial for simple graphs and determine when it has exactly two or three nonzero terms. A key tool is the interpolating property: the exponents of the nonzero terms are consecutive. Using this property together with local complementation minors of grafts, we extend the known characterization of the binomial case from connected circle graphs to all connected simple graphs, showing that such a graph has a binomial partial Petrial polynomial if and only if it is a path. Our main result characterizes the trinomial case for trees: a tree has a trinomial partial Petrial polynomial if and only if it is a T-shape tree or an H-shape tree. Here, a T-shape tree has maximum degree 3 and exactly one vertex of degree 3, whereas an H-shape tree has maximum degree 3 and exactly two vertices of degree 3, which are adjacent. We also derive explicit formulas for both families in terms of Jacobsthal numbers.