Total restrained domination numbers of trees
From MaRDI portal
Publication:2463467
Recommendations
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 2108130 (Why is no real title available?)
- Lower bound on the distance k-domination number of a tree
- Lower bound on the domination number of a tree
- On the total restrained domination number of a graph
- On total restrained domination in graphs
- Total domination in graphs
- Total domination number of grid graphs
Cited in
(18)- Total restrained domination in cubic graphs
- An improved upper bound on the total restrained domination number in cubic graphs
- Restrained domination in trees
- Total restrained domination in claw-free graphs
- Graphs with large total restrained domination number
- A note on restrained domination in trees.
- Total restrained reinforcement in graphs
- Restrained and total restrained domination in graphs
- Trees with equal total and total restrained domination numbers
- NP-completeness and APX-completeness of restrained domination in graphs
- scientific article; zbMATH DE number 6165189 (Why is no real title available?)
- On the total restrained domination edge critical graphs
- Trees with restrained domination and total restrained domination numbers
- An upper bound on the total restrained domination number of a tree
- Algorithmic and complexity aspects of problems related to total restrained domination for graphs
- Total restrained domination in graphs
- Total restrained domination in trees
- Total outer-connected domination numbers of trees
This page was built for publication: Total restrained domination numbers of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2463467)