Some Nordhaus - Gaddum Type Relations On Strong Efficient Dominating Sets
Let G = (V, E) be a simple graph with p vertices and q edges. A subset S of V(G) is called a strong (weak) efficient dominating set of G if for every vV(G),│Ns[v]∩S│=1(│Nw[v]∩S│=1).Ns(v) ={u V(G) uv E(G), deg(u) ≥ deg(v)}.The minimum cardinality of a strong (weak) efficient dominating set G is call...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Tokat Gaziosmanpasa University
2016-08-01
|
| Edice: | Journal of New Results in Science |
| Témata: | |
| On-line přístup: | https://dergipark.org.tr/en/download/article-file/270121 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|