The number of caterpillars
dc.contributor.author | Harary, Frank | en_US |
dc.contributor.author | Schwenk, Allen J. | en_US |
dc.date.accessioned | 2006-04-17T16:43:41Z | |
dc.date.available | 2006-04-17T16:43:41Z | |
dc.date.issued | 1973 | en_US |
dc.identifier.citation | Harary, Frank, Schwenk, Allen J. (1973)."The number of caterpillars." Discrete Mathematics 6(4): 359-365. <http://hdl.handle.net/2027.42/33977> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6V00-48FM0KJ-1M/2/431c511acd2f4a13316bbcf9c68810dc | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/33977 | |
dc.description.abstract | A caterpillar is a tree which metamorphoses into a path when its cocoon of endpoints is removed. The number of nonisomorphic caterpillars with n+4 points is 2n + 2[n/2]. This neat formula is proved in two ways: first, as a special case of an application of Polya's enumeration theorem which counts graphs with integer-weighted points; secondly, by an appropriate labeling of the lines of the caterpillar. | en_US |
dc.format.extent | 603331 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | The number of caterpillars | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Mathematics, University of Michigan, Ann Arbor, Mich., USA | en_US |
dc.contributor.affiliationum | Department of Mathematics, University of Michigan, Ann Arbor, Mich., USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/33977/1/0000249.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0012-365X(73)90067-8 | en_US |
dc.identifier.source | Discrete Mathematics | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
-
Interdisciplinary and Peer-Reviewed
-
Mathematical Geography, Institute of (IMaGe)
Publications and Scholarly Research Projects.
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.