Characterizing minimal point set dominating sets
From MaRDI portal
Publication:504160
DOI10.1016/J.AKCEJ.2016.07.003zbMATH Open1354.05105OpenAlexW2560783067MaRDI QIDQ504160FDOQ504160
Publication date: 25 January 2017
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.2016.07.003
Recommendations
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Point-set domination number of a graph
- A direct inductive proof of a conjecture due to E. Sampathkumar and L. Pushpa Latha on the weak domination number of a tree
- On point-set domination in graphs. IV: Separable graphs with unique minimum psd-sets
- On point-set domination in graphs. II: Minimum psd-sets
- Hereditary properties of raphs
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: Characterizing minimal point set dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q504160)