Pages that link to "Item:Q2469984"

The following pages link to Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs (Q2469984):

Displaying 23 items.

• Weighted restrained domination in subclasses of planar graphs (Q278718) (← links)
• Equality in a bound that relates the size and the restrained domination number of a graph (Q281803) (← links)
• Total restrained domination in claw-free graphs with minimum degree at least two (Q411852) (← links)
• Multiple factor Nordhaus-Gaddum type results for domination and total domination (Q423926) (← links)
• NP-completeness and APX-completeness of restrained domination in graphs (Q442103) (← links)
• Bounds on the total restrained domination number of a graph (Q604651) (← links)
• An upper bound on the total restrained domination number of a tree (Q604747) (← links)
• Total restrained domination in graphs (Q662204) (← links)
• Restrained domination in cubic graphs (Q719025) (← links)
• An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree (Q967326) (← links)
• Restrained domination in claw-free graphs with minimum degree at least two (Q968212) (← links)
• Nordhaus-Gaddum relations for proximity and remoteness in graphs (Q988253) (← links)
• Total restrained domination in cubic graphs (Q1043826) (← links)
• On a conjecture involving a bound for the total restrained domination number of a graph (Q1732113) (← links)
• An improved upper bound on the total restrained domination number in cubic graphs (Q1926030) (← links)
• Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars (Q2357136) (← links)
• Nordhaus-Gaddum bounds for total domination (Q2430063) (← links)
• Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs (Q2430322) (← links)
• The product of the restrained domination numbers of a graph and its complement (Q2452393) (← links)
• Restrained and Total Restrained Domination in Graphs (Q3384608) (← links)
• A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs (Q5261054) (← links)
• (Q5374243) (← links)
• An inequality that relates the size of a bipartite graph with its order and restrained domination number (Q5963608) (← links)