Isomorphism of weighted trees and Stanley's isomorphism conjecture for caterpillars
From MaRDI portal
Publication:2327720
Abstract: This paper contributes to a programme initiated by the first author: `How much information about a graph is revealed in its Potts partition function?'. We show that the -polynomial distinguishes non-isomorphic weighted trees of a emph{good} family. The framework developed to do so also allows us to show that the -polynomial distinguishes non-isomorphic caterpillars. This establishes Stanley's isomorphism conjecture for caterpillars, an extensively studied problem.
Recommendations
- Degrees of categoricity of trees and the isomorphism problem
- The isomorphism problem of trees from the viewpoint of Terwilliger algebras
- scientific article; zbMATH DE number 590875
- Quasi-isometries between graphs and trees
- Isomorphisms of Trees
- Greedy trees, caterpillars, and Wiener-type graph invariants
- Isomorphic factorizations of trees
- scientific article; zbMATH DE number 1556732
- Isomorphism of trees and isometry of ultrametric spaces
- Potential isomorphism and semi-proper trees
Cites work
- scientific article; zbMATH DE number 475578 (Why is no real title available?)
- A symmetric function generalization of the chromatic polynomial of a graph
- A weighted graph polynomial from chromatic invariants of knots
- Chromatic polynomial, \(q\)-binomial counting and colored Jones function
- Graph Classes: A Survey
- Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
- Graphs with equal chromatic symmetric functions
- Intersection theory for graphs
- On distinguishing trees by their chromatic symmetric functions
- Proper caterpillars are distinguished by their chromatic symmetric function
- The Potts model and chromatic functions of graphs
Cited in
(21)- A class of trees determined by their chromatic symmetric functions
- Proper \(q\)-caterpillars are distinguished by their chromatic symmetric functions
- The \(e\)-positivity and Schur positivity of some spiders and broom trees
- On the \(e\)-positivity of trees and spiders
- Schur and \(e\)-positivity of trees and cut vertices
- On the smallest trees with the same restricted \(U\)-polynomial and the rooted \(U\)-polynomial
- Non-isomorphic caterpillars with identical subtree data
- Marked Graphs and the Chromatic Symmetric Function
- Tutte polynomials for directed graphs
- A rooted variant of Stanley's chromatic symmetric function
- Extended chromatic symmetric functions and equality of ribbon Schur functions
- A deletion-contraction relation for the chromatic symmetric function
- A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function
- The chromatic symmetric function of a graph centred at a vertex
- A note on distinguishing trees with the chromatic symmetric function
- Quasisymmetric functions distinguishing trees
- Chromatic symmetric functions and polynomial invariants of trees
- Quasysimmetric invariants for families of posets
- A tree distinguishing polynomial
- Degrees of categoricity of trees and the isomorphism problem
- A few more trees the chromatic symmetric function can distinguish
This page was built for publication: Isomorphism of weighted trees and Stanley's isomorphism conjecture for caterpillars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2327720)
