On the number of caterpillars

Christian Barrientos · Indonesian Journal of Combinatorics · 2022

A caterpillar is a tree obtained from a path by attaching pendant vertices. The number of caterpillars of size n is a well-known result. In this work extend this result exploring the number of caterpillars of size n together with the cardinalities of the stable sets and the diameter. Three closed formulas are presented, giving the number of caterpillars of size n with: (i) smaller stable set of cardinality k, (ii) diameter d, and (iii) diameter d and smaller stable set of cardinality k.

Read the paper · More papers on PaperTik