Total restrained domination numbers of trees
From MaRDI portal
Publication:2463467
DOI10.1016/j.disc.2007.03.041zbMath1165.05024OpenAlexW2070054399MaRDI QIDQ2463467
Publication date: 12 December 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.041
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Total restrained reinforcement in graphs ⋮ An improved upper bound on the total restrained domination number in cubic graphs ⋮ Algorithmic and complexity aspects of problems related to total restrained domination for graphs ⋮ NP-completeness and APX-completeness of restrained domination in graphs ⋮ Total restrained domination in graphs ⋮ Total restrained domination in claw-free graphs ⋮ Restrained and Total Restrained Domination in Graphs ⋮ Total restrained domination in cubic graphs
Cites Work
This page was built for publication: Total restrained domination numbers of trees