Captive domination in graphs
From MaRDI portal
Publication:5859486
DOI10.1142/S1793830920500767zbMATH Open1458.05183OpenAlexW3033004975MaRDI QIDQ5859486FDOQ5859486
Authors: Manal N. Al-Harere, Ahmed Abed Ali Omran, Athraa T. Breesam
Publication date: 16 April 2021
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830920500767
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total domination in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- \([1,2]\)-sets in graphs
- \([1,2]\)-domination in graphs
- \((k,k^\prime,k^{\prime\prime})\)-domination in graphs
- Pitchfork domination in graphs
Cited In (6)
- Total pitchfork domination and its inverse in graphs
- Upper whole domination in a graph
- Total vertex-edge domination in graphs: Complexity and algorithms
- Some new results on captive dominating sets in graphs
- REGNANT AND CAPTIVE DOMINATION IN SOME GENERALIZED GRAPHS
- Equality co-neighborhood domination in graphs
This page was built for publication: Captive domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5859486)