We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
Peter J. Cameron, Elizabeth J. Billington, Sanming Zhou
Abstract
Every graph can be associated with a family of homogeneous polynomials, one for every degree, having as many variables as the number of vertices.
These polynomials are related to graceful labellings: a graceful polynomial with all even coefficients is a basic tool, in some cases, for proving
that a graph is non-graceful, and for generating a possibly infinite class of non-graceful graphs. Graceful polynomials also seem interesting in their
own right. In this paper we classify graphs whose graceful polynomial has all even coefficients, for small degrees up to 4. We also obtain some
new examples of non-graceful graphs
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.