Restrained domination in trees
From MaRDI portal
Publication:1969775
DOI10.1016/S0012-365X(99)00036-9zbMath0947.05057OpenAlexW2009525588MaRDI QIDQ1969775
Johannes H. Hattingh, Michael A. Henning, Lisa R. Markus, Gayla S. Domke
Publication date: 8 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00036-9
Trees (05C05) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (24)
Weighted restrained domination in subclasses of planar graphs ⋮ Further results on secure restrained domination in graphs ⋮ Bounds on the total restrained domination number of a graph ⋮ Strong restrained domination number on trees and product of graphs: An algorithmic approach ⋮ Total restrained domination in graphs of diameter 2 or 3 ⋮ NP-completeness and APX-completeness of restrained domination in graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ The product of the restrained domination numbers of a graph and its complement ⋮ Restrained domination in self-complementary graphs ⋮ On a conjecture involving a bound for the total restrained domination number of a graph ⋮ On equality in an upper bound for the restrained and total domination numbers of a graph ⋮ Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs ⋮ Total restrained domination in graphs with minimum degree two ⋮ An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree ⋮ Unnamed Item ⋮ Restrained domination in claw-free graphs with minimum degree at least two ⋮ Trees with equal domination and restrained domination numbers ⋮ Some progress on the restrained Roman domination ⋮ Restrained domination in cubic graphs ⋮ Restrained bondage in graphs ⋮ A general method in the theory of domination in graphs ⋮ Secure restrained domination in graphs ⋮ Unnamed Item ⋮ A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs
This page was built for publication: Restrained domination in trees
