The Number of Words of Length n in a Graph Monoid

DOI10.2307/2325181MaRDI QIDQ4712949zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Counting powers of words in monoids.
• scientific article; zbMATH DE number 3972221
• Sequences with Changing Dependencies
• Graphs and free partially commutative monoids

Cited in

(12)

• Bounds on the largest root of the matching polynomial
• Entropy and the clique polynomial
• scientific article; zbMATH DE number 7312755 (Why is no real title available?)
• The largest eigenvalue of a graph: A survey
• Clique polynomials and independent set polynomials of graphs
• Dependence polynomials of some graph operations
• Dependence polynomials
• On groups generated by involutions of a semigroup.
• Sequences with Changing Dependencies
• Counting powers of words in monoids.
• Note on the smallest root of the independence polynomial
• A new algorithm for compression of partially commutative alphabets

This page was built for publication: The Number of Words of Length n in a Graph Monoid

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