Restrained domination in trees

DOI10.1016/S0012-365X(99)00036-9MaRDI QIDQ1969775zbMATH OpenOpenAlexFDO

Authors Gayla S. Domke, Johannes H. Hattingh, Michael A. Henning, L. R. Markus

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

zbMATH Keywords

restrained domination numberrestrained dominating set

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Recommendations

• A note on restrained domination in trees.
• Total restrained domination in trees
• All graphs with restrained domination number three less than their order
• Restrained domination in graphs
• Total restrained domination numbers of trees

Cited in

(36)

• A general method in the theory of domination in graphs
• scientific article; zbMATH DE number 7509363 (Why is no real title available?)
• Total restrained domination in graphs of diameter 2 or 3
• On a conjecture involving a bound for the total restrained domination number of a graph
• Fractional restrained domination
• Restrained domination in self-complementary graphs
• Weighted restrained domination in subclasses of planar graphs
• Total restrained domination in trees
• The product of the restrained domination numbers of a graph and its complement
• A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs
• scientific article; zbMATH DE number 5138367 (Why is no real title available?)
• NP-completeness and APX-completeness of restrained domination in graphs
• Restrained domination in cubic graphs
• A probabilistic algorithm for bounding the total restrained domination number of a \(K_{1 , \ell}\) -free graph
• Restrained domination in claw-free graphs with minimum degree at least two
• All graphs with restrained domination number three less than their order
• On bondage numbers of graphs: a survey with some comments
• A note on total co-independent domination in trees
• A note on restrained domination in trees.
• Strong restrained domination number on trees and product of graphs: An algorithmic approach
• Restrained domination excellent trees.
• 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
• Further results on secure restrained domination in graphs
• Restrained bondage in graphs
• On weak and restrained domination in trees
• Some progress on the restrained Roman domination
• Analyzing restrained pitchfork domination across path-related graph structures
• Secure restrained domination in graphs
• A lower bound of k-component restrained domination number in trees
• Restrained Roman domination in graphs
• Global restrained Roman domination in graphs
• Bounds on the total restrained domination number of a graph
• Trees with equal domination and restrained domination numbers
• 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

This page was built for publication: Restrained domination in trees

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