Total restrained domination in claw-free graphs with minimum degree at least two

DOI10.1016/j.dam.2011.06.010zbMath1237.05152OpenAlexW2015470569MaRDI QIDQ411852

Ernst J. Joubert

Publication date: 30 April 2012

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

Full work available at URL: https://doi.org/10.1016/j.dam.2011.06.010

zbMATH Keywords

claw-freetotal restrained dominating settotal restrained domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items (3)

Restrained and total restrained domination in cographs ⋮ On a conjecture involving a bound for the total restrained domination number of a graph ⋮ Restrained and Total Restrained Domination in Graphs

Cites Work

• Unnamed Item
• Bounds on the total restrained domination number of a graph
• An upper bound on the total restrained domination number of a tree
• Total restrained domination in trees
• Total restrained domination in graphs with minimum degree two
• Total restrained domination in claw-free graphs
• Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
• On total restrained domination in graphs
• 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 claw-free graphs with minimum degree at least two