On the ratio between 2-domination and total outer-independent domination numbers of trees
From MaRDI portal
Publication:379903
DOI10.1007/s11401-013-0788-6zbMath1275.05042OpenAlexW2164787833MaRDI QIDQ379903
Publication date: 11 November 2013
Published in: Chinese Annals of Mathematics. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11401-013-0788-6
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
The ferry cover problem on regular graphs and small-degree graphs ⋮ On the ratio between 2-domination and total outer-independent domination numbers of trees ⋮ Bounds on weak and strong total domination in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the ratio between 2-domination and total outer-independent domination numbers of trees
- Total domination number of the conjunction of graphs
- Ratios of some domination parameters in trees
- Total domination of graphs and small transversals of hypergraphs
- On the total domination number of cross products of graphs
- Total domination in partitioned graphs
- Total domination in planar graphs of diameter two
- A note on total domination
- On equality in an upper bound for the restrained and total domination numbers of a graph
- On graphs with equal domination and 2-domination numbers
- Bounds for the 2-domination number of toroidal grid graphs
- On total dominating sets in graphs
- Total domination in graphs
This page was built for publication: On the ratio between 2-domination and total outer-independent domination numbers of trees
