The outer-connected domination number of a graph
From MaRDI portal
Recommendations
- Outer-\(k\)-connected component domination in graphs
- On the outer-connected domination in graphs
- On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
- scientific article; zbMATH DE number 5823716
- Algorithm and hardness results for outer-connected dominating set in graphs
Cited in
(36)- PBIB-designs and association schemes arising from minimum bi-connected dominating sets of some special classes of graphs
- On the total outer-connected domination in graphs
- A greedy algorithm for the fault-tolerant outer-connected dominating set problem
- Domination related parameters in the generalized lexicographic product of graphs
- Domination and outer connected domination in maximal outerplanar graphs
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- The outer-connected domination number of Sierpiński-like graphs
- Outer-2-independent domination in graphs
- Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy
- On the number of outer connected dominating sets of graphs
- Outer-connected domination in 2-connected cubic graphs
- scientific article; zbMATH DE number 5823716 (Why is no real title available?)
- PBIB-designs with \(m= 1, 2, 3, 4\) and \(\lfloor\frac{p}{2}\rfloor\) associated classes arising from \(\gamma_{cc}\)-sets of some special kind of graphs
- On the outer-connected domination in graphs
- Global outer connected domination number of a graph
- The outer-connected vertex edge domination number of a tree
- Outer-connected domination upon edge removal in graphs
- Finding outer-connected dominating sets in interval graphs
- Outer-weakly convex domination number of graphs
- Outer-connected 2-dominating sets of graphs
- Outer independent global dominating set of trees and unicyclic graphs
- The outer-connected vertex edge domination number in Cartesian product graphs
- scientific article; zbMATH DE number 7527888 (Why is no real title available?)
- Outer-connected open packing sets in graphs
- Outer-convex domination in graphs
- On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
- Algorithm and hardness results for outer-connected dominating set in graphs
- On the complexity of the minimum outer-connected dominating set problem in graphs
- The Outer-Paired Domination of Graphs
- Impact of diameter and convex ordering for Hamiltonicity and domination
- Outer-\(k\)-connected component domination in graphs
- Some combinatorial algorithms on the dominating number of anti-rank k hypergraphs
- A closer look at Hamiltonicity and domination through the lens of diameter and convexity
- Outer connected domination in maximal outerplanar graphs and beyond
- Total outer-connected dominating sets and total outer-connected domination polynomial of complete bipartite graph \(K_{2,n}\)
- Complexity of total outer-connected domination problem in graphs
This page was built for publication: The outer-connected domination number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5442365)
