On classes of neighborhood resolving sets of a graph
<p>Let <span class="math"><em>G</em> = (<em>V</em>, <em>E</em>)</span> be a simple connected graph. A subset <span class="math"><em>S</em></span> of <span class="math"><em>V</em></span> is called a neighbourhood set of <span class="math"><em>G</em></span> if <span class="math"><em>G</em> = ⋃<sub><em...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2018-04-01
|
| Colección: | Electronic Journal of Graph Theory and Applications |
| Materias: | |
| Acceso en línea: | http://www.ejgta.org/index.php/ejgta/article/view/249 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|