Independent (1, 2)-domination in graphs
From MaRDI portal
Recommendations
Cited in
(20)- \((1,2)\)-domination in graphs
- Independent 2-point set domination in graphs
- Independent Roman \(\{2 \}\)-domination in graphs
- Independent domination in outerplanar graphs
- On the existence and the number of independent (1,2)-dominating sets in the \(G\)-join of graphs
- Independent domination versus weighted independent domination
- scientific article; zbMATH DE number 5621287 (Why is no real title available?)
- The 2-tuple dominating independent number of a random graph
- \([1,2]\)-domination in graphs
- \((1,2)^\ast\)-domination in graphs
- 1/2-domination in graphs
- scientific article; zbMATH DE number 1420902 (Why is no real title available?)
- Independent domination in directed graphs
- Movable resolving domination in graphs
- Independent [1,2]-number versus independent domination number
- Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs
- On proper (1,2)‐dominating sets in graphs
- Independent 2-point set domination in graphs - II
- On connected co-independent domination in the join, corona and lexicographic product of graphs
- 2-domination zero forcing in graphs
This page was built for publication: Independent \((1, 2)\)-domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267449)