Counterexamples to a conjecture of Balasubramanian and Parthasarathy
classification
🧮 math.CO
keywords
polynomialbalasubramanianbivariateconjecturegraphgraphsparthasarathypermanent
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.