Abstract
We introduce path-conjoined graphs defined for two rooted graphs by joining their roots with a path, and investigate the chromatic symmetric functions of its two generalizations: spider-conjoined graphs and chain-conjoined graphs. By using the composition method developed by Zhou and the third author recently, we obtain neat positive eI-expansions for the chromatic symmetric functions of clique-path-cycle graphs, path-clique-path graphs, and clique-clique-path graphs. We pose the e-positivity conjecture for hat-chains.
| Original language | English |
|---|---|
| Pages (from-to) | 139-166 |
| Number of pages | 28 |
| Journal | Frontiers of Mathematics |
| Volume | 21 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Jan 2026 |
| Externally published | Yes |
Keywords
- 05A15
- 05E05
- Chromatic symmetric function
- Stanley–Stembridge’s conjecture
- conjoined graph
- e-positivity