Counting circular caterpillars


  • Frank Harary New Mexico State University.



Polya Enumeration Theorem


Our objects are (2.1) to introduce the graphical concept of a circular caterpillar together with cyclical "code" of non-negative integers, and (2.2) to provide an elementary example of the simplest kind of application of the celebrated Polya Enumeration Theorem.

Author Biography

Frank Harary, New Mexico State University.

Department of Computer Science.


[1] G. Chartrand and L. Lesniak, Graphs and Diagraphs (second edition), Wadsworth, Monterey (1986).

[2] N. Graham and F. Harary, Completion of broadcast trees to hypercube. To appear.

[3] P.Hage and F. Harary, Structural Models in Anthropology. Cambridge University Press, Cambridge (1983).

[4] F. Harary, Graph Theory. Addison-Wesley, Reading (1969).

[5] F. Harary, The integral of a tree. J. lnform. Sci. Eng. 4(1988)87-92.

[6] F. Harary and T.A. McKee, The square of a chordal graph. Discrete Math. 124, 197-203 (1994).

[7] F. Harary and E.M. Palmer, Graphical Enumeration. Academic Press, New York (1973).

[8] F. Harary and I.C. Ross, The square of a tree. Bell System Technical J. 39, 641-647 (1960).

[9] F. Harary and A.J. Schwenk, Trees with hamiltonian square. Mathematika 18, 138-140 (1971).

[10] F. Harary and A.J. Schwenk, The number of caterpillars. Discrete Math. 6, 359-365 (1973).



How to Cite

F. Harary, “Counting circular caterpillars”, Proyecciones (Antofagasta, On line), vol. 14, no. 1, pp. 21-26, Apr. 2018.