Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
From MaRDI portal
(Redirected from Publication:2469984)
Recommendations
Cites work
- Graphs with large restrained domination number
- scientific article; zbMATH DE number 1055145 (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?)
- On Complementary Graphs
- On total restrained domination in graphs
- Remarks on restrained domination and total restrained domination in graphs
- Restrained domination in graphs
- Restrained domination in graphs with minimum degree two
- Restrained domination in trees
Cited in
(30)- Total restrained domination in cubic graphs
- On a conjecture involving a bound for the total restrained domination number of a graph
- An improved upper bound on the total restrained domination number in cubic graphs
- Restrained and total restrained domination in cographs
- Restrained domination in self-complementary graphs
- Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars
- Nordhaus-Gaddum bounds for total domination
- Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs
- The product of the restrained domination numbers of a graph and its complement
- Weighted restrained domination in subclasses of planar graphs
- Equality in a bound that relates the size and the restrained domination number of a graph
- On total restrained domination in graphs
- Remarks on restrained domination and total restrained domination in graphs
- Restrained and total restrained domination in graphs
- Total restrained domination in claw-free graphs with minimum degree at least two
- Multiple factor Nordhaus-Gaddum type results for domination and total domination
- NP-completeness and APX-completeness of restrained domination in graphs
- A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs
- The product of the total restrained domination numbers of a graph and its complement
- scientific article; zbMATH DE number 2188609 (Why is no real title available?)
- An inequality that relates the size of a bipartite graph with its order and restrained domination number
- Bounds on the total restrained domination number of a graph
- An upper bound on the total restrained domination number of a tree
- A probabilistic algorithm for bounding the total restrained domination number of a \(K_{1 , \ell}\) -free graph
- Total restrained domination in graphs
- Restrained domination in cubic graphs
- Improving a bound that relates the size of a bipartite graph with its restrained domination number
- 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
- Nordhaus-Gaddum relations for proximity and remoteness in graphs
This page was built for publication: Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2469984)
