The Number of Labeled Outerplanar k-Cyclic Graphs
- Authors: Voblyi V.A.1
-
Affiliations:
- All-Russian Institute of Scientific and Technical Information
- Issue: Vol 103, No 5-6 (2018)
- Pages: 694-702
- Section: Article
- URL: https://journals.rcsi.science/0001-4346/article/view/150849
- DOI: https://doi.org/10.1134/S0001434618050024
- ID: 150849
Cite item
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.
About the authors
V. A. Voblyi
All-Russian Institute of Scientific and Technical Information
Author for correspondence.
Email: vitvobl@yandex.ru
Russian Federation, Moscow
Supplementary files
