Pages that link to "Item:Q367057"
From MaRDI portal
The following pages link to An upper bound for the total restrained domination number of graphs (Q367057):
Displaying 14 items.
- 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)
- Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph (Q477351) (← 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)
- 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)
- 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)
- On equality in an upper bound for the restrained and total domination numbers of a graph (Q2461210) (← links)
- On the total restrained domination number of direct products of graphs (Q2866411) (← links)
- (Q2936660) (← links)
- Restrained and Total Restrained Domination in Graphs (Q3384608) (← links)
- (Q4598345) (← links)
