Connected domination value in graphs
<p class="p1">In a connected graph <em>G</em> = (<em>V,E</em>), a set <em>D</em> ⊂ <em>V</em> is a <em>connected dominating set</em> if for every vertex <em>v</em> ∈ <em>V </em>\ <em>D</em>...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2021-04-01
|
| Series: | Electronic Journal of Graph Theory and Applications |
| Subjects: | |
| Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/736 |