Total restrained domination in graphs
From MaRDI portal
Recommendations
- On the total restrained domination number of a graph
- An upper bound for the total restrained domination number of graphs
- Results on total restrained domination in graphs
- Total restrained domination in unicyclic graphs.
- The product of the total restrained domination numbers of a graph and its complement
Cites work
- scientific article; zbMATH DE number 3639144 (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
- An upper bound on the total restrained domination number of a tree
- Bounds on the total restrained domination number of a graph
- Graph theory
- Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
- On equality in an upper bound for the restrained and total domination numbers of a graph
- On the total restrained domination number of a graph
- On total restrained domination in graphs
- Orientations of digraphs almost preserving diameter
- Restrained domination in graphs
- Results on total restrained domination in graphs
- Total restrained domination in claw-free graphs
- Total restrained domination in cubic graphs
- Total restrained domination in graphs with minimum degree two
- Total restrained domination in trees
- Total restrained domination numbers of trees
Cited in
(36)- The restrained double Roman domination and graph operations
- Total restrained domination in graphs of diameter 2 or 3
- Results on total restrained domination in graphs
- The product of the total restrained domination numbers of a graph and its complement
- Restrained {2}-domination in graphs
- On the total restrained domination edge critical graphs
- Restricted total domination in graphs
- Weighted restrained domination in subclasses of planar graphs
- Total restrained domination in trees
- On total restrained domination in graphs
- On roman, global and restrained domination in graphs
- NP-completeness and APX-completeness of restrained domination in graphs
- Total restrained domination in unicyclic graphs.
- Domination related parameters in the generalized lexicographic product of graphs
- A probabilistic algorithm for bounding the total restrained domination number of a \(K_{1 , \ell}\) -free graph
- scientific article; zbMATH DE number 5635305 (Why is no real title available?)
- Algorithmic and complexity aspects of problems related to total restrained domination for graphs
- Restrained step triple connected domination number of a graph
- Total restrained reinforcement in graphs
- Restrained and total restrained domination in cographs
- Total restrained domination in unicyclic graphs
- On the total restrained domination number of a graph
- Total restrained domination in claw-free graphs
- Restrained and total restrained domination in graphs
- Restrained domination polynomial of join and corona of graphs
- Restricted domination parameters in graphs
- Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
- Graphs with large total restrained domination number
- scientific article; zbMATH DE number 6383811 (Why is no real title available?)
- An upper bound for the total restrained domination number of graphs
- Bounds on the total restrained domination number of a graph
- Remarks on restrained domination and total restrained domination in graphs
- Restrained domination and its variants in extended supergrid graphs
- On the total restrained domination number of direct products of graphs
- Total restrained domination in graphs with minimum degree two
- scientific article; zbMATH DE number 5759533 (Why is no real title available?)
This page was built for publication: Total restrained domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q662204)
