Total restrained domination in trees

DOI10.1016/J.DISC.2006.09.014MaRDI QIDQ879341zbMATH OpenOpenAlexFDO

Authors Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Joubert, Andrew R. Plummer

Publication date 11 May 2007

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.09.014

zbMATH Keywords

total restrained dominationtree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Review text

A subset \(S\) of the vertex set \(V\) of a graph \(G(V, E)\) is a total restrained dominating set if every vertex is adjacent to a vertex in \(S\) and every vertex of \(V-S\) is adjacent to a vertex in \(V-S\). The total restrained domination number of \(G\) is the smallest cardinality of a total restrained dominating set of \(G\). The paper gives lower bounds for the total restrained domination number for trees of order \(n\) and of order \(n = 0\) mod 4. It also constructively characterizes the extremal trees of order \(n\) achieving these lower bounds.

Recommendations

• Restrained domination in trees
• Total restrained domination numbers of trees
• Trees with restrained domination and total restrained domination numbers
• A note on restrained domination in trees.
• On weak and restrained domination in trees
• An upper bound on the total restrained domination number of a tree
• Trees with equal total and total restrained domination numbers
• Total restrained domination in graphs
• Trees with equal domination and restrained domination numbers
• Total domination and least domination in a tree

Cites work

• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• Remarks on restrained domination and total restrained domination in graphs

Cited in

(20)

• Total restrained domination in cubic graphs
• A survey of stratified domination in graphs
• Total domination and least domination in a tree
• An improved upper bound on the total restrained domination number in cubic graphs
• Restrained domination in trees
• Total restrained domination in claw-free graphs
• Total restrained bondage in graphs
• Total restrained domination numbers of trees
• A note on restrained domination in trees.
• Restrained and total restrained domination in graphs
• Trees with equal total and total restrained domination numbers
• Total restrained domination in claw-free graphs with minimum degree at least two
• NP-completeness and APX-completeness of restrained domination in graphs
• On the total restrained domination edge critical graphs
• Trees with restrained domination and total restrained domination numbers
• Bounds on the total restrained domination number of a graph
• An upper bound on the total restrained domination number of a tree
• Total restrained domination in graphs
• 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

This page was built for publication: Total restrained domination in trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879341)