Dominating Set Counting in Graph Classes

DOI10.1007/978-3-642-22685-4_2MaRDI QIDQ3087935zbMATH OpenOpenAlexFDO

Authors Shuji Kijima, Yoshio Okamoto, Takeaki Uno

Publication date 17 August 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22685-4_2

Mathematics Subject Classification ID

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

Recommendations

• Counting dominating sets and related structures in graphs
• Counting dominating sets in some subclasses of bipartite graphs
• On total dominating sets in graphs
• Set domination in graphs
• Dominating sets in directed graphs
• A note on the number of dominating sets of a graph
• Domination number of total graphs
• On the total domination number of graphs
• On the number of minimal dominating sets on some graph classes
• Dominating functions and total dominating functions of countable graphs

Cited in

(10)

• Fast and simple algorithms for counting dominating sets in distance-hereditary graphs
• Counting dominating sets in generalized series-parallel graphs
• Counting independent dominating sets in linear polymers
• Approximately counting locally-optimal structures
• Counting representable sets on simple graphs
• Graph operations and neighborhood polynomials
• Counting dominating sets in some subclasses of bipartite graphs
• Counting dominating sets in cactus chains
• Counting minimal dominating sets
• On the enumeration and counting of minimal dominating sets in interval and permutation graphs

This page was built for publication: Dominating Set Counting in Graph Classes

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