Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/3067
Title: | The equivalence of two graph polynomials and a symmetric function |
Authors: | Merino, C Noble, SD |
Keywords: | Graph polynomial;Graph symmetric function;Chromatic polynomial;Tutte polynomial;Polychromate |
Issue Date: | 2009 |
Publisher: | Cambridge University Press |
Citation: | Combinatorics, Probability and Computing. 18 : 601-615 |
Abstract: | The U-polynomial, the polychromate and the symmetric function generalization of the Tutte polynomial due to Stanley are known to be equivalent in the sense that the coefficients of any one of them can be obtained as a function of the coefficients of any other. The definition of each of these functions suggests a natural way in which to strengthen them which also captures Tutte's universal V-function as a specialization. We show that the equivalence remains true for the strong functions thus answering a question raised by Dominic Welsh. |
URI: | http://bura.brunel.ac.uk/handle/2438/3067 http://journals.cambridge.org/production/action/cjoGetFulltext?fulltextid=5238228 |
ISSN: | 0963-5483 |
Appears in Collections: | Dept of Mathematics Research Papers Mathematical Sciences |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
equivalencecpcrevised.pdf | 167.06 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.