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

DOI10.33048/daio.2021.28.715zbMath1496.05083OpenAlexW4205555139MaRDI QIDQ5100136

V. A. Voblyj

Publication date: 29 August 2022

Published in: Diskretnyi analiz i issledovanie operatsii (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/da1285

zbMATH Keywords

asymptoticsblockenumerationbridgeless graphlabeled graphrandom graphseries-parallel graph\(k\)-cyclic graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Asymptotic enumeration (05A16)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random graphs from a block-stable class
• Counting bridgeless graphs
• On the asymptotic enumeration of labeled connected \(k\)-cyclic graphs without bridges
• Enumeration of labeled connected bicyclic and tricyclic graphs without bridges
• Enumeration and limit laws for series-parallel graphs
• Enumeration of labeled connected graphs with given order and size
• The number of connected sparsely edged graphs. IV large nonseparable graphs
• Low-connectivity network design on series-parallel graphs
• The Second Riddell Relation and Its Consequences

This page was built for publication: Asymptotic enumeration of labeled series-parallel $k$-cyclic bridgeless graphs