Counterexamples to a conjecture of Balasubramanian and Parthasarathy
Combinatorics
2017-05-25 v1
Abstract
In 1980, Balasubramanian and Parthasarathy introduced the bivariate permanent polynomials of graphs and conjectured that this graph polynomial is a graph characterising polynomial, that is, any two graphs with the same bivariate permanent polynomial are isomorphic. In this note, we give counter examples to this conjecture.
Keywords
Cite
@article{arxiv.1502.01886,
title = {Counterexamples to a conjecture of Balasubramanian and Parthasarathy},
author = {Shunyi Liu},
journal= {arXiv preprint arXiv:1502.01886},
year = {2017}
}
Comments
5 pages, 1 figure