Total restrained domination in graphs with minimum degree two
From MaRDI portal
Publication:952652
DOI10.1016/J.DISC.2007.04.039zbMATH Open1226.05195OpenAlexW1991601643MaRDI QIDQ952652FDOQ952652
Michael A. Henning, J. E. Maritz
Publication date: 12 November 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.04.039
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total domination in graphs
- Upper total domination in claw‐free graphs
- Some remarks on domination
- Graphs with large total domination number
- 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
- Restrained domination in graphs with minimum degree two
- Title not available (Why is that?)
- Remarks on restrained domination and total restrained domination in graphs
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Characterizations of trees with equal domination parameters
- On total restrained domination in graphs
- Total restrained domination in trees
- Title not available (Why is that?)
- On equality in an upper bound for domination parameters of graphs
Cited In (16)
- 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
- 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
- Bounds on domination parameters in graphs: a brief survey
- Title not available (Why is that?)
- 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
- Restrained and Total Restrained Domination in Graphs
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)
