Restrained and total restrained domination in graphs
From MaRDI portal
Publication:3384608
Recommendations
Cites work
- \(k\)-tuple total restrained domination/domatic in graphs
- A note on restrained domination in trees.
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- All graphs with restrained domination number three less than their order
- An improved upper bound on the total restrained domination number in cubic graphs
- An inequality that relates the size of a bipartite graph with its order and 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
- An upper bound for the total restrained domination number of graphs
- An upper bound on the total restrained domination number of a tree
- Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets
- Bounds on the total restrained domination number of a graph
- Connected domination number of a graph and its complement
- Efficient sets in partial k-trees
- Equality in a bound that relates the size and the restrained domination number of a graph
- Graphs with large restrained domination number
- scientific article; zbMATH DE number 617552 (Why is no real title available?)
- scientific article; zbMATH DE number 2109321 (Why is no real title available?)
- scientific article; zbMATH DE number 3358515 (Why is no real title available?)
- Maximum sizes of graphs with given restrained domination numbers
- Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
- On a conjecture involving a bound for the total restrained domination number of a graph
- On Complementary 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
- Practical algorithms on partial k-trees with an application to domination-like problems
- Restrained domination in claw-free graphs with minimum degree at least two
- Restrained domination in cubic graphs
- Restrained domination in graphs
- Restrained domination in graphs with minimum degree two
- Restrained domination in self-complementary graphs
- Restrained domination in unicyclic graphs
- Restrained double domination number of a graph
- Secure restrained domination in graphs
- The product of the restrained domination numbers of a graph and its complement
- The product of the total restrained domination numbers of a graph and its complement
- Total restrained domination in claw-free graphs with minimum degree at least two
- Total restrained domination in cubic graphs
- Total restrained domination in graphs
- Total restrained domination in graphs with minimum degree two
- Total restrained domination in trees
- Total restrained domination numbers of trees
- Trees with equal domination and restrained domination numbers
- Trees with equal total and total restrained domination numbers
- Trees with restrained domination and total restrained domination numbers
Cited in
(25)- On a conjecture involving a bound for the total restrained domination number of a graph
- Total restrained domination in claw-free graphs
- Restricted domination parameters in graphs
- Secure restrained domination in graphs
- Restrained domination and its variants in extended supergrid graphs
- Restrained domination in graphs with minimum degree two
- Weighted restrained domination in subclasses of planar graphs
- scientific article; zbMATH DE number 5759533 (Why is no real title available?)
- scientific article; zbMATH DE number 5635305 (Why is no real title available?)
- An upper bound for the total restrained domination number of graphs
- NP-completeness and APX-completeness of restrained domination in graphs
- scientific article; zbMATH DE number 6820568 (Why is no real title available?)
- Bounds on the total restrained domination number of a graph
- scientific article; zbMATH DE number 7693193 (Why is no real title available?)
- Restrained {2}-domination in graphs
- Restrained double Italian domination in graphs
- Restrained domination polynomial of join and corona of graphs
- Restrained Italian bondage number in graphs
- Relatively prime restrained detour domination number of a graph
- Best possible upper bounds on the restrained domination number of cubic graphs
- On the total restrained double Italian domination
- A probabilistic algorithm for bounding the total restrained domination number of a \(K_{1 , \ell}\) -free graph
- Total restrained coalitions in graphs
- On the (total) restrained double Italian domination of central of graphs
- Total restrained domination in graphs with minimum degree two
This page was built for publication: Restrained 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 Q3384608)
