On a conjecture involving a bound for the total restrained domination number of a graph

DOI10.1016/J.DAM.2018.11.019zbMath1407.05182OpenAlexW2904280027WikidataQ123198333 ScholiaQ123198333MaRDI QIDQ1732113

Ernst J. Joubert

Publication date: 22 March 2019

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

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

zbMATH Keywords

upper bounddominationtotal restrained domination

Mathematics Subject Classification ID

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

Related Items (2)

Bounds on domination parameters in graphs: a brief survey ⋮ Restrained and Total Restrained Domination in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• An upper bound for the total restrained domination number of graphs
• Total restrained domination in claw-free graphs with minimum degree at least two
• Bounds on the total restrained domination number of a graph
• Total restrained domination in graphs with minimum degree two
• Restrained domination in graphs
• Restrained domination in 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
• 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: On a conjecture involving a bound for the total restrained domination number of a graph