A New Formula for the Number of Labeled Series-Parallel Graphs

A series-parallel graph is a graph that does not contain a complete graph with four vertices as a minor. A new explicit simpler formula for the number of labeled series-parallel biconnected graphs with a given number of vertices is obtained.

Saved in:
Bibliographic Details
Published inJournal of mathematical sciences (New York, N.Y.) Vol. 277; no. 5; pp. 718 - 721
Main Author Voblyi, V. A.
Format Journal Article
LanguageEnglish
Published Cham Springer International Publishing 22.12.2023
Springer
Springer Nature B.V
Subjects
Apexes
Graph theory
Graphs
Mathematics
Mathematics and Statistics
2-connected graph
series-parallel graph
explicit formula
enumeration
labeled graph
05C30
Online AccessGet full text
ISSN1072-3374
1573-8795
DOI10.1007/s10958-023-06877-1

Cover

More Information
Summary:A series-parallel graph is a graph that does not contain a complete graph with four vertices as a minor. A new explicit simpler formula for the number of labeled series-parallel biconnected graphs with a given number of vertices is obtained.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1072-3374
1573-8795
DOI:10.1007/s10958-023-06877-1