Frank Harary and Allen J. Schwenk [The number of caterpillars, Discrete Mathematics, 6 (1973), 359-365] have given an elegant formula for counting the number of non-isomorphic caterpillars on n vertices with n ≥ 3. In this paper we provide an alternate simple proof for Frank Harary and Allen J. Schwenk formula using combination with repetition.

1.
Douglas B.
West
,
Introduction to Graph Theory
,
Pearson Education
, Second Edition,
2001
.
2.
Frank
Harary
and
Allen J.
Schwenk
,
The number of Caterpillars
,
Discrete Mathematics
,
6
(
1973
),
359
365
.
3.
J. H.
Van Link
and
R. M.
Wilson
, A Course in Combinatorics,
Cambridge University Press
, Edition 2,
2001
.
This content is only available via PDF.