Consider the caterpillar in part (i) of Fig. 12.50. If we label each edge of the spine
Question:
We also note that the reversal of the binary string 10001001-namely, 10010001-corresponds with a second caterpillar that is isomorphic to the one in part (i) of Fig. 12.50.
(a) Find the binary strings for each of the caterpillars in part (ii) of Figs. 12.50 and 12.51.
(b) Can a caterpillar have a binary string of all l's?
(c) Can the binary string for a caterpillar have only two l's?
(d) Draw all the nonisomorphic caterpillars on five vertices. For each caterpillar determine its binary string. How many of these binary strings are palindromes?
(e) Answer the question posed in part (d) upon replacing "five" by "six."
(f) For n ¥ 3, prove that the number of nonisomorphic caterpillars on n vertices is (1/2)(2n-3 + 2(n-3)/2) = 2n-4 + 2(n-4/2= 2n-4 + 2n/2-2. (This was first established in 1973 by F. Harary and A. J. Schwenk.)
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Discrete and Combinatorial Mathematics An Applied Introduction
ISBN: 978-0201726343
5th edition
Authors: Ralph P. Grimaldi
Question Posted: