The product of the total restrained domination numbers of a graph and its complement
From MaRDI portal
Publication:5374243
zbMATH Open1383.05238MaRDI QIDQ5374243FDOQ5374243
Ernst J. Joubert, Johannes H. Hattingh
Publication date: 10 April 2018
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/70/ajc_v70_p297.pdf
Recommendations
- The product of the restrained domination numbers of a graph and its complement
- Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
- Total restrained domination in graphs
- Results on total restrained domination in graphs
- An upper bound for the total restrained domination number of graphs
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Restrained domination in graphs
- Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
- Remarks on restrained domination and total restrained domination in graphs
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- On Complementary Graphs
- Title not available (Why is that?)
- Bounds on the total restrained domination number of a graph
- Total restrained domination in graphs with minimum degree two
- Connected domination number of a graph and its complement
- The product of the restrained domination numbers of a graph and its complement
Cited In (2)
This page was built for publication: The product of the total restrained domination numbers of a graph and its complement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5374243)
