2021
DOI: 10.37236/10018
|View full text |Cite
|
Sign up to set email alerts
|

A Vertex-Weighted Tutte Symmetric Function, and Constructing Graphs with Equal Chromatic Symmetric Function

Abstract: This paper has two main parts. First, we consider the Tutte symmetric function XB, a generalization of the chromatic symmetric function. We introduce a vertex-weighted version of XB and show that this function admits a deletion-contraction relation. We also demonstrate that the vertex-weighted XB admits spanning-tree and spanning-forest expansions generalizing those of the Tutte polynomial by connecting XB to other graph functions. Second, we give several methods for constructing nonisomorphic graphs with equa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 23 publications
0
6
0
Order By: Relevance
“…Example 12. The following two trees were given in [18] as an example of two non-isomorphic weighted graphs with the same W polynomial (for the general construction of paths with the same Wpolynomial see [1,3,6]). Note that these two trees can be thought as marked trees with marks (w, 0) and as such they have different M -polynomial.…”
Section: Weighted Tree Reconstruction From Marked Polynomialsmentioning
confidence: 99%
“…Example 12. The following two trees were given in [18] as an example of two non-isomorphic weighted graphs with the same W polynomial (for the general construction of paths with the same Wpolynomial see [1,3,6]). Note that these two trees can be thought as marked trees with marks (w, 0) and as such they have different M -polynomial.…”
Section: Weighted Tree Reconstruction From Marked Polynomialsmentioning
confidence: 99%
“…The Tutte (or bad-colouring) symmetric function XB (G,w) is defined as a symmetric function with coefficient ring C[t] as [4,35]…”
Section: Vertex-weighted Graphs and Colouringsmentioning
confidence: 99%
“…where the sum ranges over all colourings of G (not just the proper ones), with e(κ) equal to the number of edges of G whose endpoints receive the same colour from κ. From [4] we also have…”
Section: Vertex-weighted Graphs and Colouringsmentioning
confidence: 99%
See 2 more Smart Citations