Enumeration of labeled block-cactus graphs

DOI10.1134/S1990478914030156zbMATH Open1324.05094OpenAlexW2053941340MaRDI QIDQ5264730FDOQ5264730

Author name not available (Why is that?)

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

zbMATH Keywords

asymptoticsenumerationcactusblock graphblock-cactus graphHusimi graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithmic aspects of the \(k\)-domination problem in graphs
• Enumerative problems inspired by Mayer's theory of cluster integrals
• Single variable Bell polynomials
• Title not available (Why is that?)
• Title not available (Why is that?)
• Enumeration of labeled outerplanar bicyclic and tricyclic graphs
• Enumeration of labeled bicyclic and tricyclic Eulerian graphs
• The lower and upper forcing geodetic numbers of block--cactus graphs

Cited In (6)

• Enumeration of \(m\)-ary cacti
• The Second Riddell Relation and Its Consequences
• Enumeration of labeled outerplanar bicyclic and tricyclic graphs
• Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs
• Enumeration of labeled connected graphs with given order and size
• Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs

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

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