Total outer-connected domination numbers of trees
From MaRDI portal
Recommendations
- Total outer-connected domination in trees
- Total domination versus total outer connected domination in trees
- A note on the total outer-connected domination number of a tree
- The outer-connected vertex edge domination number of a tree
- On trees with equal domination and total outer-independent domination numbers
- Total and paired-domination numbers of a tree
- On the total outer-connected domination in graphs
- Trees with large total domination number
- Total restrained domination numbers of trees
- An upper bound on the total outer-independent domination number of a tree
Cites work
Cited in
(15)- A note on the total outer-connected domination number of a tree
- On trees with equal total domination and 2-outer-independent domination numbers
- Total outer connected vertex-edge domination
- On the total outer-connected domination in graphs
- The outer-connected vertex edge domination number of a tree
- Total domination versus total outer connected domination in trees
- Unicyclic graphs with equal total and total outer-connected domination numbers.
- Generalization of the total outer-connected domination in graphs
- Total outer-connected domination subdivision numbers in graphs
- On trees with equal domination and total outer-independent domination numbers
- Total outer-connected domination in trees
- Complexity of total outer-connected domination problem in graphs
- On the complexity of the minimum outer-connected dominating set problem in graphs
- Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs
- Trees with large neighborhood total domination number
This page was built for publication: Total outer-connected domination numbers of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967375)