An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree

DOI10.1016/J.DAM.2009.03.010MaRDI QIDQ967326zbMATH OpenOpenAlexFDO

Authors Johannes H. Hattingh, Ernst J. Joubert

Publication date 28 April 2010

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

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

zbMATH Keywords

graphminimum degreedominationupper boundrestrained dominationorder of a graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Restrained domination in graphs with minimum degree two
• Restrained domination in claw-free graphs with minimum degree at least two
• An upper bound for the total restrained domination number of graphs
• On equality in an upper bound for the restrained and total domination numbers of a graph
• Graphs with large restrained domination number

Cites work

• scientific article; zbMATH DE number 3159208 (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.
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• 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 domination parameters of graphs
• On equality in an upper bound for the restrained and total domination numbers of a graph
• On total restrained domination in graphs
• Remarks on restrained domination and 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 trees
• Trees with equal domination and restrained domination numbers

Cited in

(13)

• scientific article; zbMATH DE number 7509363 (Why is no real title available?)
• An inequality that relates the size of a bipartite graph with its order and restrained domination number
• The product of the restrained domination numbers of a graph and its complement
• A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs
• NP-completeness and APX-completeness of restrained domination in graphs
• Restrained domination in claw-free graphs with minimum degree at least two
• On bondage numbers of graphs: a survey with some comments
• Restrained and total restrained domination in graphs
• On equality in an upper bound for the restrained and total domination numbers of a graph
• Restrained domination in graphs with minimum degree two
• An upper bound for the total restrained domination number of graphs
• Bounds on the total restrained domination number of a graph
• Relatively prime restrained detour domination number of a graph

This page was built for publication: An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree

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