Enumeration of connected graphs with cut vertices

DOI10.1016/S0378-3758(02)00225-2MaRDI QIDQ698029zbMATH OpenFDO

Authors Ying-Lie Jin, Shinsei Tazawa, Teruhiro Shirakura

Publication date 18 September 2002

Published in Journal of Statistical Planning and Inference (Search for Journal in Brave)

zbMATH Keywords

blockgenerating functionconnected graphcut vertexcycle indexgraphical enumeration

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30)

Recommendations

• scientific article; zbMATH DE number 1246474
• On enumeration of labelled connected graphs by the number of cutpoints
• scientific article; zbMATH DE number 1558262
• The enumeration of labeled graphs by number of cutpoints
• Enumeration of labeled connected graphs with given order and size

Cites work

• scientific article; zbMATH DE number 4068908 (Why is no real title available?)
• scientific article; zbMATH DE number 4112624 (Why is no real title available?)
• scientific article; zbMATH DE number 3490286 (Why is no real title available?)
• scientific article; zbMATH DE number 1246474 (Why is no real title available?)
• scientific article; zbMATH DE number 530033 (Why is no real title available?)
• scientific article; zbMATH DE number 597551 (Why is no real title available?)
• scientific article; zbMATH DE number 221922 (Why is no real title available?)
• scientific article; zbMATH DE number 5934267 (Why is no real title available?)
• scientific article; zbMATH DE number 3299758 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• A series of search designs for \(2^ m\) factorial designs of resolution V which permit search of one or two unknown extra three-factor interactions
• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I
• Enumeration and Representation of Nonisomorphic Bipartite Graphs
• Enumeration of non-separable graphs
• Enumeration of unlabelled bicolored graphs by degree parities

Cited in

(6)

• The enumeration of labeled graphs by number of cutpoints
• On the maximum Zagreb indices of graphs with \(k\) cut vertices
• On enumeration of labelled connected graphs by the number of cutpoints
• scientific article; zbMATH DE number 1558262 (Why is no real title available?)
• Patchworks and metablocks enumeration
• Symmetric regular cacti-properties and enumeration

This page was built for publication: Enumeration of connected graphs with cut vertices

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