Characterizing minimal point set dominating sets
From MaRDI portal
Publication:504160
DOI10.1016/j.akcej.2016.07.003zbMath1354.05105OpenAlexW2560783067MaRDI QIDQ504160
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
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Point-set domination number of a graph
- On point-set domination in graphs. II: Minimum psd-sets
- Hereditary properties of raphs
This page was built for publication: Characterizing minimal point set dominating sets