The product of the total restrained domination numbers of a graph and its complement
From MaRDI portal
Publication:5374243
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
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 3358515 (Why is no real title available?)
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Bounds on the total restrained domination number of a graph
- Connected domination number of a graph and its complement
- Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
- On Complementary Graphs
- Remarks on restrained domination and total restrained domination in graphs
- Restrained domination in graphs
- The product of the restrained domination numbers of a graph and its complement
- Total restrained domination in graphs with minimum degree two
Cited in
(6)- Restrained domination in self-complementary graphs
- The product of the restrained domination numbers of a graph and its complement
- Total restrained domination in graphs
- Restrained and total restrained domination in graphs
- Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
- On the total restrained domination number of direct products of graphs
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)
