Pages that link to "Item:Q2997598"
From MaRDI portal
The following pages link to Total outer-connected domination in trees (Q2997598):
Displaying 18 items.
- A note on the total outer-connected domination number of a tree (Q547559) (← links)
- A lower bound on the total outer-independent domination number of a tree (Q627257) (← links)
- Complexity of total outer-connected domination problem in graphs (Q896660) (← links)
- Total outer-connected domination numbers of trees (Q967375) (← links)
- Bounds on the signed Roman \(k\)-domination number of a digraph (Q1630924) (← links)
- Total domination and least domination in a tree (Q1874378) (← links)
- On the total outer-connected domination in graphs (Q2015786) (← links)
- Domination related parameters in the generalized lexicographic product of graphs (Q2030248) (← links)
- Total domination on tree operators (Q2112050) (← links)
- Trees with large neighborhood total domination number (Q2348059) (← links)
- Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs (Q2430322) (← links)
- Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy (Q2692638) (← links)
- Generalization of the total outer-connected domination in graphs (Q2805478) (← links)
- Total outer-connected domination subdivision numbers in graphs (Q2864851) (← links)
- An upper bound on the total outer-independent domination number of a tree (Q2901940) (← links)
- Certified domination (Q5154565) (← links)
- On the complexity of the minimum outer-connected dominating set problem in graphs (Q5963605) (← links)
- Total outer connected vertex-edge domination (Q6174136) (← links)