The Bipartition Polynomial of a Graph: Reconstruction, Decomposition, and Applications
Combinatorics
2017-02-14 v1
Abstract
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving graph properties. In addition, we can show that the bipartition polynomial is polynomially reconstructible, which means that we can recover it from the multiset of bipartition polynomials of one-edge-deleted subgraphs.
Keywords
Cite
@article{arxiv.1702.03546,
title = {The Bipartition Polynomial of a Graph: Reconstruction, Decomposition, and Applications},
author = {Seongmin Ok and Peter Tittmann},
journal= {arXiv preprint arXiv:1702.03546},
year = {2017}
}
Comments
20 pages, 1 figure