{"title":"标记序列-并行$k$-循环无桥图的渐近枚举","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":"{\"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}","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}
Asymptotic enumeration of labeled series-parallel $k$-cyclic bridgeless graphs
— 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
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
