Graphs with Equal Chromatic Symmetric Functions

TL;DR

This paper introduces a new method to express the chromatic symmetric function of graphs as combinations of smaller graphs' functions, constructs examples of unicyclic graphs with identical functions, and explores tree identification from these functions.

Contribution

It presents a novel technique for decomposing chromatic symmetric functions, constructs infinite pairs of unicyclic graphs with the same functions, and classifies certain trees based on their chromatic symmetric functions.

Findings

A new linear combination technique for ${f X}_G$

Existence of infinite unicyclic graph pairs with equal ${f X}_G$

Classification of single-centroid trees via their chromatic symmetric functions

Abstract

Stanley [9] introduced the chromatic symmetric function ${\bf X}_G$ associated to a simple graph $G$ as a generalization of the chromatic polynomial of $G$. In this paper we present a novel technique to write ${\bf X}_G$ as a linear combination of chromatic symmetric functions of smaller graphs. We use this technique to give a sufficient condition for two graphs to have the same chromatic symmetric function. We then construct an infinite family of pairs of unicyclic graphs with the same chromatic symmetric function, answering the question posed by Martin, Morin, and Wagner [7] of whether such a pair exists. Finally, we approach the problem of whether it is possible to determine a tree from its chromatic symmetric function. Working towards an answer to this question, we give a classification theorem for single-centroid trees in terms of data closely related to its chromatic symmetric function.