Enumeration of labeled block-cactus graphs
From MaRDI portal
Publication:5264730
DOI10.1134/S1990478914030156zbMath1324.05094OpenAlexW2053941340MaRDI QIDQ5264730
No author found.
Publication date: 27 July 2015
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1990478914030156
Related Items (5)
Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs ⋮ Enumeration of labeled connected graphs with given order and size ⋮ Enumeration of labeled outerplanar bicyclic and tricyclic graphs ⋮ Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs ⋮ The Second Riddell Relation and Its Consequences
Cites Work
- Single variable Bell polynomials
- Enumerative problems inspired by Mayer's theory of cluster integrals
- Enumeration of labeled bicyclic and tricyclic Eulerian graphs
- The lower and upper forcing geodetic numbers of block--cactus graphs
- Algorithmic aspects of the \(k\)-domination problem in graphs
- Enumeration of labeled outerplanar bicyclic and tricyclic graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Enumeration of labeled block-cactus graphs
