Hypo-efficient domination and hypo-unique domination
For a graph $G$ let $\gamma (G)$ be its domination number. We define a graph G to be (i) a hypo-efficient domination graph (or a hypo-$\mathcal{ED}$ graph) if $G$ has no efficient dominating set (EDS) but every graph formed by removing a single vertex from $G$ has at least...
| 1. autor: | |
|---|---|
| Format: | Artykuł |
| Język: | English |
| Wydane: |
Azarbaijan Shahide Madani University
2016-06-01
|
| Seria: | Communications in Combinatorics and Optimization |
| Hasła przedmiotowe: | |
| Dostęp online: | http://comb-opt.azaruniv.ac.ir/article_13553.html |