Lower bound on the minus-domination number

DOI10.1016/S0012-365X(00)00252-1zbMath0986.05081OpenAlexW2126944068MaRDI QIDQ5936043

Ji{ří} Matoušek

Publication date: 6 June 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00252-1

zbMATH Keywords

regular graphminus-domination numbermultigraphsprobabilistic method

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (6)

Upper minus total domination in small-degree regular graphs ⋮ An application of the Turán theorem to domination in graphs ⋮ On complexities of minus domination ⋮ Dominating functions with integer values in graphs—a survey ⋮ Signed and Minus Dominating Functions in Graphs ⋮ On Complexities of Minus Domination

This page was built for publication: Lower bound on the minus-domination number