Outer-k-connected component domination in graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5823716
- On the outer-connected domination in graphs
- On the total outer-connected domination in graphs
- Generalization of the total outer-connected domination in graphs
- Domination and outer connected domination in maximal outerplanar graphs
- Connected domination in maximal outerplanar graphs
- On the number of outer connected dominating sets of graphs
- The outer-connected domination number of a graph
- Outer-convex domination in graphs
- Complexity of total outer-connected domination problem in graphs
Cited in
(11)- Outer-connected domination in 2-connected cubic graphs
- scientific article; zbMATH DE number 5823716 (Why is no real title available?)
- Dominating sets inducing large components in maximal outerplanar graphs
- The outer-connected domination number of Sierpiński-like graphs
- On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
- The outer-connected domination number of a graph
- Generalization of the total outer-connected domination in graphs
- Global outer connected domination number of a graph
- An exceptional invariant $k$-component order neighbor connectivity -- a generalization of domination alteration sets in graphs
- Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
- On the number of outer connected dominating sets of graphs
This page was built for publication: Outer-\(k\)-connected component domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656132)
