Total restrained domination in graphs with minimum degree two
From MaRDI portal
Publication:952652
DOI10.1016/j.disc.2007.04.039zbMath1226.05195OpenAlexW1991601643MaRDI QIDQ952652
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
Related Items
Bounds on domination parameters in graphs: a brief survey, An upper bound for the total restrained domination number of graphs, Bounds on the total restrained domination number of a graph, An improved upper bound on the total restrained domination number in cubic graphs, Total restrained domination in claw-free graphs with minimum degree at least two, NP-completeness and APX-completeness of restrained domination in graphs, On roman, global and restrained domination in graphs, Total restrained domination in graphs, On a conjecture involving a bound for the total restrained domination number of a graph, Total restrained domination in claw-free graphs, Unnamed Item, Restrained and Total Restrained Domination in Graphs, Total restrained domination in cubic graphs, A survey of stratified domination in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total restrained domination in trees
- 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
- On equality in an upper bound for domination parameters of graphs
- On total restrained domination in graphs
- Remarks on restrained domination and total restrained domination in graphs
- Total domination in graphs
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Upper total domination in claw‐free graphs
- Some remarks on domination
- Characterizations of trees with equal domination parameters
- Graphs with large total domination number
