Chromatic Symmetric Functions of Conjoined Graphs

  • Ethan Yuanjian Qi
  • , Davion Qibao Tang
  • , David G.L. Wang*
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)139-166
Number of pages28
JournalFrontiers of Mathematics
Volume21
Issue number1
DOIs
Publication statusPublished - Jan 2026
Externally publishedYes

Keywords

  • 05A15
  • 05E05
  • Chromatic symmetric function
  • Stanley–Stembridge’s conjecture
  • conjoined graph
  • e-positivity

Fingerprint

Dive into the research topics of 'Chromatic Symmetric Functions of Conjoined Graphs'. Together they form a unique fingerprint.

Cite this