Enumeration of connected graphs with cut vertices

DOI10.1016/S0378-3758(02)00225-2zbMath0995.05067MaRDI QIDQ698029

Teruhiro Shirakura, Shinsei Tazawa, Ying-Lie Jin

Publication date: 18 September 2002

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

zbMATH Keywords

blockgenerating functionconnected graphcycle indexcut vertexgraphical enumeration

Mathematics Subject Classification ID

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

Related Items (1)

On the maximum Zagreb indices of graphs with \(k\) cut vertices

Cites Work

• 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
• Enumeration of unlabelled bicolored graphs by degree parities
• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I
• Enumeration and Representation of Nonisomorphic Bipartite Graphs
• Enumeration of non-separable graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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