On the total outer-connected domination in graphs
From MaRDI portal
Publication:2015786
Recommendations
Cites work
- scientific article; zbMATH DE number 1529462 (Why is no real title available?)
- A note on the total outer-connected domination number of a tree
- On the doubly connected domination number of a graph
- The outer-connected domination number of a graph
- Total domination in graphs
- Total outer-connected domination in trees
- Total outer-connected domination numbers of trees
Cited in
(17)- scientific article; zbMATH DE number 5823716 (Why is no real title available?)
- On the outer-connected domination in graphs
- Outer-\(k\)-connected component domination in graphs
- A note on the total outer-connected domination number of a tree
- Total outer-connected domination numbers of trees
- scientific article; zbMATH DE number 7690927 (Why is no real title available?)
- The outer-connected domination number of Sierpiński-like graphs
- Generalization of the total outer-connected domination in graphs
- Total outer-connected domination subdivision numbers in graphs
- Outer-weakly convex domination number of graphs
- Total outer-connected domination in trees
- Finding outer-connected dominating sets in interval graphs
- Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
- Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy
- 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
This page was built for publication: On the total outer-connected domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015786)
