Abstract
A non-crossing connected graph is a connected graph on vertices arranged in a circle such that its edges do not cross. The count for such graphs can be made naturally into a q-binomial generating function. We prove that this generating function exhibits the cyclic sieving phenomenon, as conjectured by S.-P. Eu. © 2011 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France.
Author supplied keywords
Cite
CITATION STYLE
APA
Guo, A. (2011). Cyclic sieving phenomenon in non-crossing connected graphs. In FPSAC’11 - 23rd International Conference on Formal Power Series and Algebraic Combinatorics (pp. 435–444). https://doi.org/10.46298/dmtcs.2923
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free