Pages that link to "Item:Q604651"
From MaRDI portal
The following pages link to Bounds on the total restrained domination number of a graph (Q604651):
Displaying 14 items.
- An upper bound for the total restrained domination number of graphs (Q367057) (← links)
- Total restrained domination in graphs of diameter 2 or 3 (Q405425) (← 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)
- Total restrained domination in graphs (Q662204) (← 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)
- (Q2936660) (← links)
- Restrained and Total Restrained Domination in Graphs (Q3384608) (← links)
- (Q3645782) (← links)
- (Q4598345) (← links)
- (Q5374243) (← links)
- A probabilistic algorithm for bounding the total restrained domination number of a \(K_{1 , \ell}\) -free graph (Q6611042) (← links)