Enumeration of labeled bi-block graphs

DOI10.33048/DAIO.2023.30.778MaRDI QIDQ6644077zbMATH OpenFDO

Authors Vitaliĭ Anatolievich Voblyĭ

Publication date 27 November 2024

Published in Diskretnyĭ Analiz i Issledovanie Operatsiĭ (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33048/DAIO.2023.30.778

zbMATH Keywords

asymptoticsbi-block graphblockbridgeless graphcomplete bipartite graphenumerationlabeled graphplanar graphrandom graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Asymptotic enumeration of labeled series-parallel k-cyclic bridgeless graphs
• Publication:3487415
• Enumeration of bipartite graphs and bipartite blocks
• Enumeration of labeled connected bicyclic and tricyclic graphs without bridges
• Enumeration of labeled connected graphs with given order and size

Cites work

• A formula for the number of labeled connected graphs
• Analytic combinatorics
• scientific article; zbMATH DE number 3821741 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Inverse of the distance matrix of a bi-block graph
• Labeled Bipartite Blocks
• On the spectral radius of bi-block graphs with given independence number \(\alpha\)
• Permanent, determinant, and rank of bi-block graphs
• Random graphs from a block-stable class
• The second Riddell relation and its consequences

This page was built for publication: Enumeration of labeled bi-block graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644077)