Restrained domination excellent trees.
From MaRDI portal
Recommendations
Cited in
(8)- On independent \([1, 2]\)-sets in trees
- Total domination excellent trees
- Trees with equal domination and restrained domination numbers
- Secure restrained domination in graphs
- Bounds on the total restrained domination number of a graph
- Restrained domination in cubic graphs
- An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
- Restrained domination in claw-free graphs with minimum degree at least two
This page was built for publication: Restrained domination excellent trees.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3070295)