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 subset <em>S</em> of vertices in <em>G</em> is called a <em>dominating set</em> if every verte...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2020-10-01
|
| Collection: | Electronic Journal of Graph Theory and Applications |
| Sujets: | |
| Accès en ligne: | http://www.ejgta.org/index.php/ejgta/article/view/1059 |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|