Pages that link to "Item:Q967326"
From MaRDI portal
The following pages link to 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):
Displaying 9 items.
- NP-completeness and APX-completeness of restrained domination in graphs (Q442103) (← links)
- Bounds on the total restrained domination number of a graph (Q604651) (← links)
- Restrained domination in claw-free graphs with minimum degree at least two (Q968212) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- The product of the restrained domination numbers of a graph and its complement (Q2452393) (← links)
- On equality in an upper bound for the restrained and total domination numbers of a graph (Q2461210) (← links)
- Restrained and Total Restrained Domination in Graphs (Q3384608) (← links)
- (Q5070078) (← links)
- A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs (Q5261054) (← links)
