Bounds on the total restrained domination number of a graph

DOI10.1007/s00373-010-0894-0zbMath1231.05202OpenAlexW1986178710MaRDI QIDQ604651

Elizabeth Jonck, Johannes H. Hattingh, Ernst J. Joubert

Publication date: 12 November 2010

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

Full work available at URL: https://doi.org/10.1007/s00373-010-0894-0

zbMATH Keywords

graphdiameterminimum degreedominationtotal restrained dominationorder of a graphupperbound

Mathematics Subject Classification ID

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

Related Items (6)

Total restrained domination in claw-free graphs with minimum degree at least two ⋮ Multiple factor Nordhaus-Gaddum type results for domination and total domination ⋮ Total restrained domination in graphs ⋮ On a conjecture involving a bound for the total restrained domination number of a graph ⋮ Unnamed Item ⋮ Restrained and Total Restrained Domination in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
• Graphs with large restrained domination number
• 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
• Trees with equal domination and restrained domination numbers
• On total restrained domination in graphs

This page was built for publication: Bounds on the total restrained domination number of a graph