Counting dominating sets in generalized series-parallel graphs

DOI10.1142/S1793830919500745zbMath1427.05164OpenAlexW2975341716WikidataQ127198624 ScholiaQ127198624MaRDI QIDQ5207508

Min-Sheng Lin

Publication date: 2 January 2020

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830919500745

zbMATH Keywords

dominating setscounting problemsgeneralized series-parallel graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Counting dominating sets in some subclasses of bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of selected recent results on total domination in graphs
• Combinatorial algorithms on a class of graphs
• A linear algorithm for the domination number of a series-parallel graph
• Dominating Set Counting in Graph Classes
• Steiner trees, connected domination and strongly chordal graphs
• The Complexity of Enumeration and Reliability Problems
• The Complexity of Planar Counting Problems
• Total domination in interval graphs

This page was built for publication: Counting dominating sets in generalized series-parallel graphs