Relatively prime restrained detour domination number of a graph
From MaRDI portal
Publication:6549470
Recommendations
- Restrained and total restrained domination in graphs
- Secure restrained domination in graphs
- On the total restrained domination number of a graph
- 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 graphs with minimum degree two
This page was built for publication: Relatively prime restrained detour domination number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6549470)