An upper bound for the total restrained domination number of graphs

DOI10.1007/s00373-012-1189-4zbMath1272.05150OpenAlexW2140660564MaRDI QIDQ367057

Zeinab Maleki, Behnaz Omoomi, Khee Meng Koh

Publication date: 26 September 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1189-4

zbMATH Keywords

matchingindependent setprobabilistic methodopen packingtotal restrained dominating settotal restrained domination number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

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

Cites Work

• Total restrained domination in graphs with minimum degree two
• A survey of selected recent results on total domination in graphs
• Total domination number of grid graphs
• On total restrained domination in graphs
• Total domination in graphs
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An upper bound for the total restrained domination number of graphs