Two cycle-chord graphs are e-positive

MaRDI QIDQ6385506zbMATH OpenFDO

Authors David G. L. Wang, Monica M. Y. Wang

Publication date 13 December 2021

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Coloring of graphs and hypergraphs (05C15) Symmetric functions and generalizations (05E05)

Abstract: We prove Gebhard and Sagan's $(e)$-positivity of the line graphs of tadpoles in noncommuting variables. This implies the $e$-positivity of these line graphs. We then extend this $(e)$-positivity result to that of certain cycle-chord graphs, and derive the bivariate generating function of all cycle-chord graphs.

This page was built for publication: Two cycle-chord graphs are $e$-positive

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6385506)