Two cycle-chord graphs are $e$-positive
David G.L. Wang, Monica M.Y. Wang

TL;DR
This paper proves the $e$-positivity of line graphs of tadpoles and certain cycle-chord graphs, extending known results and providing a bivariate generating function for these graphs.
Contribution
It extends the $e$-positivity proof to cycle-chord graphs and derives their bivariate generating function, building on Gebhard and Sagan's work.
Findings
Proves $e$-positivity of line graphs of tadpoles.
Extends $e$-positivity to certain cycle-chord graphs.
Derives bivariate generating function for cycle-chord graphs.
Abstract
We prove Gebhard and Sagan's -positivity of the line graphs of tadpoles in noncommuting variables. This implies the -positivity of these line graphs. We then extend this -positivity result to that of certain cycle-chord graphs, and derive the bivariate generating function of all cycle-chord graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph theory and applications · Markov Chains and Monte Carlo Methods
