|
|||||
|
|
The Number of Labeled Outerplanar |
|
| Authors: | V.?A.?Voblyi author-information" > author-information__contact u-icon-before" > mailto:vitvobl@yandex.ru" title=" vitvobl@yandex.ru" itemprop=" email" data-track=" click" data-track-action=" Email author" data-track-label=" " >Email author |
| Affiliation: | 1.All-Russian Institute of Scientific and Technical Information,Russian Academy of Sciences,Moscow,Russia |
| Abstract: | A k-cyclic graph is a graph with cyclomatic number k. An explicit formula for the number of labeled connected outerplanar k-cyclic graphs with a given number of vertices is obtained. In addition, such graphs with fixed cyclomatic number k and a large number of vertices are asymptotically enumerated. As a consequence, it is found that, for fixed k, almost all labeled connected outerplanar k-cyclic graphs with a large number of vertices are cacti. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |