Total restrained domination in trees

DOI10.1016/J.DISC.2006.09.014zbMath1132.05044OpenAlexW2053482026MaRDI QIDQ879341

Elizabeth Jonck, Ernst J. Joubert, Johannes H. Hattingh, Andrew R. Plummer

Publication date: 11 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2006.09.014

zbMATH Keywords

treetotal restrained domination

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (12)

Bounds on the total restrained domination number of a graph ⋮ An upper bound on the total restrained domination number of a tree ⋮ An improved upper bound on the total restrained domination number in cubic graphs ⋮ Total restrained domination in claw-free graphs with minimum degree at least two ⋮ NP-completeness and APX-completeness of restrained domination in graphs ⋮ 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 ⋮ Total restrained domination in claw-free graphs ⋮ Restrained and Total Restrained Domination in Graphs ⋮ Total restrained domination in cubic graphs ⋮ A survey of stratified domination in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Remarks on restrained domination and total restrained domination in graphs
• Algorithms for Vertex Partitioning Problems on Partial k-Trees

This page was built for publication: Total restrained domination in trees