2-Point set domination in separable graphs
From MaRDI portal
Publication:6170769
Recommendations
Cites work
- scientific article; zbMATH DE number 1055145 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 2089976 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- 2-point set domination number of a cactus
- A survey on the domination of fuzzy graphs
- Bounds on 2-point set domination number of a graph
- Domination in graphoidal covers of a graph
- Double domination and super domination in trees
- Equitable fair domination in graphs
- Global 2-point set domination number of a graph
- Independent domination in graphs: A survey and recent results
- Minimal 2-point set dominating sets of a graph
- Mixed Roman domination in graphs
- Point-set domination number of a graph
- Set domination in graphs
- Weak edge-degree domination in hypergraphs
Cited in
(5)
This page was built for publication: 2-Point set domination in separable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6170769)