Bounds on the total restrained domination number of a graph

DOI10.1007/S00373-010-0894-0zbMATH Open1231.05202OpenAlexW1986178710MaRDI QIDQ604651FDOQ604651

Authors Johannes H. Hattingh, Elizabeth Jonck, 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

graphminimum degreediameterdominationtotal restrained dominationorder of a graphupperbound

Mathematics Subject Classification ID

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

Recommendations

• An upper bound for the total restrained domination number of graphs
• On the total restrained domination number of a graph
• On a conjecture involving a bound for the total restrained domination number of a graph
• Restrained and total restrained domination in graphs
• An upper bound on the restrained domination number of graphs.
• On equality in an upper bound for the restrained and total domination numbers of a graph
• Total restrained domination in graphs
• scientific article; zbMATH DE number 6820568
• Results on total restrained domination in graphs
• Bounds on the restrained Roman domination number of a graph

Cites work

• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• A note on restrained domination in trees.
• An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
• An upper bound on the total restrained domination number of a tree
• Graphs with large restrained domination number
• Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
• On equality in an upper bound for the restrained and total domination numbers of a graph
• On the total restrained domination number of a graph
• On total restrained domination in graphs
• Restrained domination excellent trees.
• Restrained domination in graphs
• Restrained domination in graphs with minimum degree two
• Restrained domination in trees
• Total restrained domination in graphs with minimum degree two
• Total restrained domination in trees
• Trees with equal domination and restrained domination numbers

Cited in

(15)

• Total restrained domination in graphs
• An improved upper bound on the total restrained domination number in cubic graphs
• scientific article; zbMATH DE number 6383811 (Why is no real title available?)
• A probabilistic algorithm for bounding the total restrained domination number of a \(K_{1 , \ell}\) -free graph
• scientific article; zbMATH DE number 5635305 (Why is no real title available?)
• Multiple factor Nordhaus-Gaddum type results for domination and total domination
• Total restrained domination in graphs of diameter 2 or 3
• On a conjecture involving a bound for the total restrained domination number of a graph
• Total restrained domination in claw-free graphs with minimum degree at least two
• NP-completeness and APX-completeness of restrained domination in graphs
• An upper bound for the total restrained domination number of graphs
• Restrained and total restrained domination in graphs
• The product of the total restrained domination numbers of a graph and its complement
• scientific article; zbMATH DE number 6820568 (Why is no real title available?)
• On the total restrained domination number of a graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604651)