Majorization and the minimum number of dominating sets

DOI10.1016/j.dam.2013.05.002zbMath1288.05197OpenAlexW2129993990MaRDI QIDQ2448915

Zdzisław Skupień

Publication date: 5 May 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.05.002

zbMATH Keywords

majorizationdomination numbertotal dominationcontinuizationcounting dominating setsnumerical partition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Graphs with few total dominating sets ⋮ Toward a Nordhaus-Gaddum inequality for the number of dominating sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domination alteration sets in graphs
• A linear algorithm for the domination number of a tree
• Two Bounds for the Domination Number of a Graph
• Inequalities: theory of majorization and its applications

This page was built for publication: Majorization and the minimum number of dominating sets