On the ratio between 2-domination and total outer-independent domination numbers of trees
From MaRDI portal
Publication:379903
DOI10.1007/S11401-013-0788-6zbMATH Open1275.05042OpenAlexW2164787833MaRDI QIDQ379903FDOQ379903
Authors: Marcin Krzywkowski 
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
Recommendations
- On trees with equal total domination and 2-outer-independent domination numbers
- On trees with equal 2-domination and 2-outer-independent domination numbers
- An upper bound on the 2-outer-independent domination number of a tree
- On trees with double domination number equal to 2-domination number plus one
- An upper bound on the total outer-independent domination number of a tree
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total domination in graphs
- Total domination of graphs and small transversals of hypergraphs
- On equality in an upper bound for the restrained and total domination numbers of a graph
- Title not available (Why is that?)
- Bounds for the 2-domination number of toroidal grid graphs
- Total domination in partitioned graphs
- Total domination in planar graphs of diameter two
- A note on total domination
- On graphs with equal domination and 2-domination numbers
- Bounds of the 2-domination number of graphs
- Title not available (Why is that?)
- On total dominating sets in graphs
- On the ratio between 2-domination and total outer-independent domination numbers of trees
- Title not available (Why is that?)
- Total domination in \(K_5\)- and \(K_6\)-covered graphs
- Independence and 2-domination in bipartite graphs
- Domination in planar graphs with small diameter II.
- Total domination number of the conjunction of graphs
- Ratios of some domination parameters in trees
- On the total domination number of cross products of graphs
Cited In (5)
- The ferry cover problem on regular graphs and small-degree graphs
- On trees with equal 2-domination and 2-outer-independent domination numbers
- On trees with equal total domination and 2-outer-independent domination numbers
- Bounds on weak and strong total domination in graphs
- On the ratio between 2-domination and total outer-independent domination numbers of trees
This page was built for publication: On the ratio between 2-domination and total outer-independent domination numbers of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q379903)
