Asymptotic enumeration of labeled series-parallel $k$-cyclic bridgeless graphs

V. A. Voblyi
{"title":"Asymptotic enumeration of labeled series-parallel $k$-cyclic bridgeless graphs","authors":"V. A. Voblyi","doi":"10.33048/daio.2021.28.715","DOIUrl":null,"url":null,"abstract":"— We deduce the asymptotics for the number of labeled connected series-parallel k -cyclic graphs with large order and fi xed number k . We prove that almost all labeled series-parallel k -cyclic connected graphs without bridges for fi xed k are blocks","PeriodicalId":126663,"journal":{"name":"Diskretnyi analiz i issledovanie operatsii","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Diskretnyi analiz i issledovanie operatsii","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33048/daio.2021.28.715","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

— We deduce the asymptotics for the number of labeled connected series-parallel k -cyclic graphs with large order and fi xed number k . We prove that almost all labeled series-parallel k -cyclic connected graphs without bridges for fi xed k are blocks
标记序列-并行$k$-循环无桥图的渐近枚举
-我们推导了大阶固定k的标记连通序列-并行k -循环图的渐近性。证明了对于固定k,几乎所有标记的无桥序列并行k循环连通图都是块
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信