Degree equitable restrained double domination in graphs
<p class="p1">A subset <em>D</em> ⊆ <em>V</em>(<em>G</em>) is called an equitable dominating set of a graph <em>G</em> if every vertex <em>v</em> ∈ <em>V</em>(<em>G</em>) \ <em>D</em> has a neighbor <em>u </em>∈<em> D</em> such that |<em>d<sub>G</sub></em>(<em>u</em>)-<em>d<sub>G</sub></em>(<em>v</e...
Uloženo v:
| Hlavní autoři: | , , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2021-04-01
|
| Edice: | Electronic Journal of Graph Theory and Applications |
| Témata: | |
| On-line přístup: | http://www.ejgta.org/index.php/ejgta/article/view/445 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|