Co-adjoint polynomial
Combinatorics
2017-12-12 v2
Abstract
In this note we study a certain graph polynomial arising from a special recursion. This recursion is a member of a family of four recursions where the other three recursions belong to the chromatic polynomial, the modified matching polynomial, and the adjoint polynomial, respectively. The four polynomials share many common properties, for instance all of them are of exponential type, i. e., they satisfy the identity for every graph . It turns out that the new graph polynomial is a specialization of the Tutte polynomial.
Cite
@article{arxiv.1603.02594,
title = {Co-adjoint polynomial},
author = {Péter Csikvári},
journal= {arXiv preprint arXiv:1603.02594},
year = {2017}
}