A statistic related to trees and words on a finite alphabet

DOI10.1142/S1793830916500312zbMath1339.05020OpenAlexW2291490375MaRDI QIDQ3178161

Mark Shattuck, Toufik Mansour

Publication date: 8 July 2016

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830916500312

zbMATH Keywords

generating functiontreesPrüfer code\(k\)-ary words

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Shedding light on words ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting labelled trees with given indegree sequence
• On the parity of the Wiener index
• Words restricted by patterns with at most 2 distinct letters
• Successions in words and compositions
• On coding labeled trees
• Ascents and descents in random trees
• The enumeration of rooted trees by total height

This page was built for publication: A statistic related to trees and words on a finite alphabet