| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652387 | Electronic Notes in Discrete Mathematics | 2009 | 5 Pages |
Abstract
Let c(n) be the maximum number of cycles in an outerplanar graph with n vertices. We show that limc(n)1/n exists and equals β=1.502837…, where β is a constant related to the recurrence , x0=1. The same result holds for the larger class of series-parallel graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
