Total restrained domination in graphs with minimum degree two
From MaRDI portal
(Redirected from Publication:952652)
Recommendations
- Restricted total domination in graphs with minimum degree two
- Restrained domination in graphs with minimum degree two
- Restricted domination in graphs with minimum degree 2
- Total restrained domination in graphs
- Restrained and total restrained domination in graphs
- Total restrained domination in graphs of diameter 2 or 3
- On the total restrained domination number of a graph
- Restricted total domination in graphs
- Total restrained domination in claw-free graphs with minimum degree at least two
- Domination in graphs with minimum degree two
Cites work
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- 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 1462928 (Why is no real title available?)
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Characterizations of trees with equal domination parameters
- Graphs with large restrained domination number
- Graphs with large total domination number
- On equality in an upper bound for domination parameters of graphs
- On equality in an upper bound for the restrained and total domination numbers of a graph
- 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
- Some remarks on domination
- Total domination in graphs
- Total restrained domination in trees
- Upper total domination in claw‐free graphs
Cited in
(16)- Total restrained domination in claw-free graphs with minimum degree at least two
- The product of the total restrained domination numbers of a graph and its complement
- On a conjecture involving a bound for the total restrained domination number of a graph
- On roman, global and restrained domination in graphs
- Total restrained domination in graphs
- NP-completeness and APX-completeness of restrained domination in graphs
- A probabilistic algorithm for bounding the total restrained domination number of a \(K_{1 , \ell}\) -free graph
- Total restrained domination in cubic graphs
- Total restrained domination in claw-free graphs
- An improved upper bound on the total restrained domination number in cubic graphs
- Restrained and total restrained domination in graphs
- Bounds on domination parameters in graphs: a brief survey
- A survey of stratified domination in graphs
- Restrained domination in graphs with minimum degree two
- An upper bound for the total restrained domination number of graphs
- Bounds on the total restrained domination number of a graph
This page was built for publication: Total restrained domination in graphs with minimum degree two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952652)