Weighted Tutte-Grothendieck polynomials of graphs
From MaRDI portal
Publication:6063286
Abstract: In this paper, we introduce the concept of the weighted (harmonic) chromatic polynomials of graphs and discuss some of its properties. We also present the notion of the weighted (harmonic) Tutte--Grothendieck polynomials of graphs and give a generalization of the recipe theorem between the harmonic Tutte--Grothendieck polynomials graphs and the harmonic Tutte polynomials of matroids. Moreover, we give some constructions of the weighted (harmonic) Tutte--Grothendieck invariants for graphs and the weighted (harmonic) Tutte invariants for matroids. Finally, we give a remark on the categorification of the harmonic chromatic polynomials of graphs and harmonic Tutte polynomials of matroids.
Recommendations
- Tutte polynomials of vertex-weighted graphs and group cohomology
- A weighted graph polynomial from chromatic invariants of knots
- A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function
- The polychromate and a chord diagram polynomial
- Plethysms of chromatic and Tutte symmetric functions
Cites work
- A categorification for the chromatic polynomial
- A Contribution to the Theory of Chromatic Polynomials
- A Course in Enumeration
- A Decomposition for Combinatorial Geometries
- An introduction to homological algebra
- Hahn Polynomials, Discrete Harmonics, andt-Designs
- Harmonic Tutte polynomials of matroids
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 3049182 (Why is no real title available?)
- Matroids and Graphs
- Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
- On dichromatic polynomials
- On harmonic weight enumerators of binary codes
- Weight Enumeration and the Geometry of Linear Codes
Cited in
(5)
This page was built for publication: Weighted Tutte-Grothendieck polynomials of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6063286)