The Number of Labeled Outerplanar k-Cyclic Graphs
- 作者: Voblyi V.A.1
-
隶属关系:
- All-Russian Institute of Scientific and Technical Information
- 期: 卷 103, 编号 5-6 (2018)
- 页面: 694-702
- 栏目: Article
- URL: https://journals.rcsi.science/0001-4346/article/view/150849
- DOI: https://doi.org/10.1134/S0001434618050024
- ID: 150849
如何引用文章
详细
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.
作者简介
V. Voblyi
All-Russian Institute of Scientific and Technical Information
编辑信件的主要联系方式.
Email: vitvobl@yandex.ru
俄罗斯联邦, Moscow
补充文件
