An upper bound on the total restrained domination number of a tree
From MaRDI portal
Publication:604747
DOI10.1007/s10878-008-9204-7zbMath1229.90162OpenAlexW2000580348MaRDI QIDQ604747
Elizabeth Jonck, Ernst J. Joubert, Johannes H. Hattingh
Publication date: 12 November 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-008-9204-7
Related Items (6)
Bounds on the total restrained domination number of a graph ⋮ Total restrained domination in claw-free graphs with minimum degree at least two ⋮ Total restrained domination in graphs ⋮ An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree ⋮ Restrained domination in claw-free graphs with minimum degree at least two ⋮ Restrained and Total Restrained Domination in Graphs
Cites Work
This page was built for publication: An upper bound on the total restrained domination number of a tree
