Bounds on the total restrained domination number of a graph
From MaRDI portal
Publication:604651
DOI10.1007/S00373-010-0894-0zbMATH Open1231.05202OpenAlexW1986178710MaRDI QIDQ604651FDOQ604651
Authors: Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Joubert 
Publication date: 12 November 2010
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0894-0
Recommendations
- An upper bound for the total restrained domination number of graphs
- On the total restrained domination number of a graph
- On a conjecture involving a bound for the total restrained domination number of a graph
- Restrained and total restrained domination in graphs
- An upper bound on the restrained domination number of graphs.
- On equality in an upper bound for the restrained and total domination numbers of a graph
- Total restrained domination in graphs
- scientific article; zbMATH DE number 6820568
- Results on total restrained domination in graphs
- Bounds on the restrained Roman domination number of a graph
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graphs with large restrained domination number
- Restrained domination in graphs
- Restrained domination in trees
- On equality in an upper bound for the restrained and total domination numbers of a graph
- Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
- Restrained domination in graphs with minimum degree two
- On the total restrained domination number of a graph
- On total restrained domination in graphs
- An upper bound on the total restrained domination number of a tree
- Total restrained domination in graphs with minimum degree two
- An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
- Total restrained domination in trees
- A note on restrained domination in trees.
- Trees with equal domination and restrained domination numbers
- Restrained domination excellent trees.
Cited In (14)
- On a conjecture involving a bound for the total restrained domination number of a graph
- Total restrained domination in claw-free graphs with minimum degree at least two
- Multiple factor Nordhaus-Gaddum type results for domination and total domination
- Total restrained domination in graphs
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- On the total restrained domination number of a graph
- An improved upper bound on the total restrained domination number in cubic graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- An upper bound for the total restrained domination number of graphs
- Restrained and Total Restrained Domination in Graphs
This page was built for publication: Bounds on the total restrained domination number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604651)
