Total restrained domination in graphs

DOI10.1016/j.camwa.2011.07.059zbMath1231.05196OpenAlexW2092586594MaRDI QIDQ662204

Juan Liu, Xing Chen, Ji Xiang Meng

Publication date: 21 February 2012

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2011.07.059

zbMATH Keywords

cyclepathtotal restrained dominationtotal restrained dominating set

Mathematics Subject Classification ID

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

Related Items (3)

Restrained {2}-domination in graphs ⋮ Domination related parameters in the generalized lexicographic product of graphs ⋮ Restrained and Total Restrained Domination in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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 cubic graphs
• Restrained domination in graphs
• Orientations of digraphs almost preserving diameter
• Total restrained domination in claw-free graphs
• On equality in an upper bound for the restrained and total domination numbers of a graph
• Total restrained domination numbers of trees
• Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
• On total restrained domination in graphs
• Algorithms for Vertex Partitioning Problems on Partial k-Trees

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