The geodetic domination number of comb product graphs
<p>A subset <em>S</em> of vertices in graph <em>G</em> is called a <em>geodetic set</em> if every vertex in <em>V</em>(<em>G</em>) \ <em>S</em> lies on a shortest path between two vertices in <em>S</em>. A subs...
| Main Authors: | , |
|---|---|
| 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
2020-10-01
|
| Series: | Electronic Journal of Graph Theory and Applications |
| Subjects: | |
| Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/1059 |