Independent point-set dominating sets in graphs
From MaRDI portal
Publication:5154582
DOI10.1016/J.AKCEJ.2019.08.001zbMATH Open1473.05223OpenAlexW2970630501WikidataQ127330988 ScholiaQ127330988MaRDI QIDQ5154582FDOQ5154582
Authors: Purnima Gupta, Alka Goyal, Ranjana Jain 
Publication date: 5 October 2021
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2019.08.001
Recommendations
Cites Work
- Graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Independence Ratio of Regular Graphs
- Point-set domination number of a graph
- Global 2-point set domination number of a graph
- On point-set domination in graphs. IV: Separable graphs with unique minimum psd-sets
- On point-set domination in graphs. II: Minimum psd-sets
- Characterizing minimal point set dominating sets
- Characterization of graphs with equal domination numbers and independence numbers
- Graph equations for line graphs, total graphs, middle graphs and quasi- total graphs
- Title not available (Why is that?)
- On point-set domination in graphs. VI: Quest to characterise blocks containing independent PSD-sets
- Point-set domination in graphs. VIII: Perfect and efficient PSD sets
- Point-set domatic numbers of graphs
Cited In (4)
This page was built for publication: Independent point-set dominating sets in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154582)
