2-Point set domination in separable graphs
From MaRDI portal
Publication:6170769
DOI10.1142/S1793830922500446zbMATH Open1516.05167OpenAlexW4200367700MaRDI QIDQ6170769FDOQ6170769
Authors: Purnima Gupta, Deepti Jain 
Publication date: 13 July 2023
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830922500446
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weak edge-degree domination in hypergraphs
- Independent domination in graphs: A survey and recent results
- Domination in graphoidal covers of a graph
- Point-set domination number of a graph
- 2-point set domination number of a cactus
- Global 2-point set domination number of a graph
- Set domination in graphs
- Mixed Roman domination in graphs
- Bounds on 2-point set domination number of a graph
- Equitable fair domination in graphs
- Double domination and super domination in trees
- Minimal 2-point set dominating sets of a graph
- Title not available (Why is that?)
- A survey on the domination of fuzzy graphs
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)
