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...
I tiakina i:
| Ngā kaituhi matua: | , , , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2021-04-01
|
| Rangatū: | Electronic Journal of Graph Theory and Applications |
| Ngā marau: | |
| Urunga tuihono: | http://www.ejgta.org/index.php/ejgta/article/view/445 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|