The Number of Words of Length n in a Graph Monoid

DOI10.2307/2325181zbMath0774.05006OpenAlexW2088548189MaRDI QIDQ4712949

David C. Fisher

Publication date: 25 June 1992

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2325181

zbMATH Keywords

wordsenumerationgraph monoid

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Graph theory (05C99)

Related Items

Dependence polynomials, Unnamed Item, On groups generated by involutions of a semigroup., Dependence polynomials of some graph operations, A new algorithm for compression of partially commutative alphabets, Note on the Smallest Root of the Independence Polynomial, Bounds on the largest root of the matching polynomial, Entropy and the clique polynomial, The largest eigenvalue of a graph: A survey, Clique polynomials and independent set polynomials of graphs