Stanley's original definition in [1]} considered only unweighted graphs, which is the case where all vertex weights are equal to 1. We say that an (unweighted) simple graph is distinguished by the chromatic symmetric function if any other simple graph with the same chromatic symmetric function must be isomorphic. Stanley's tree isomorphism conjecture is as follows.
