An upper bound on the total outer-independent domination number of a tree
From MaRDI portal
Publication:2901940
DOI10.7494/OPMATH.2012.32.1.153zbMATH Open1245.05099MaRDI QIDQ2901940FDOQ2901940
Authors: Marcin Krzywkowski 
Publication date: 31 July 2012
Published in: Opuscula Mathematica (Search for Journal in Brave)
Recommendations
- A lower bound on the total outer-independent domination number of a tree
- An upper bound on the 2-outer-independent domination number of a tree
- An upper bound for the double outer-independent domination number of a tree
- A lower bound on the double outer-independent domination number of a tree
- Total outer-connected domination in trees
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (11)
- A note on the total outer-connected domination number of a tree
- A lower bound on the total outer-independent domination number of a tree
- Total outer-connected domination numbers of trees
- Outer independent global dominating set of trees and unicyclic graphs
- An upper bound for the double outer-independent domination number of a tree
- On trees attaining an upper bound on the total domination number
- A note on total co-independent domination in trees
- A lower bound on the double outer-independent domination number of a tree
- On trees with equal domination and total outer-independent domination numbers
- An upper bound on the 2-outer-independent domination number of a tree
- On the ratio between 2-domination and total outer-independent domination numbers of trees
This page was built for publication: An upper bound on the total outer-independent domination number of a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901940)
