Answers are grounded in this paper and cite their sources.
We show that the chromatic quasisymmetric function (CQF) of a labeled path graph on n vertices is not symmetric unless the labeling is the natural labeling $1, 2, ..., n$ or its reverse $n, ..., 2, 1$. We also show that the star graph K1, n-1 with n≥ 3 has a nonsymmetric CQF for all labelings. Classifying all labeled trees with a symmetric CQF remains an open question.
No takes yet. Share an insight, caveat, or question.
Aliniaeifard et al. (2024) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: