The Bipartition Polynomial of a Graph: Reconstruction, Decomposition, and Applications
From MaRDI portal
Publication:6283073
arXiv1702.03546MaRDI QIDQ6283073FDOQ6283073
Authors: Seongmin Ok, Peter Tittmann 
Publication date: 12 February 2017
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.
This page was built for publication: The Bipartition Polynomial of a Graph: Reconstruction, Decomposition, and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6283073)
