Open-independent, open-locating-dominating sets
A distinguishing set for a graph G = (V, E) is a dominating set D, each vertex $v \in D$ being the location of some form of a locating device, from which one can detect and precisely identify any given "intruder" vertex in V(G). As with many applications of dominating sets, the set $D$ might be req...
Gardado en:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2017-10-01
|
| Series: | Electronic Journal of Graph Theory and Applications |
| Assuntos: | |
| Acceso en liña: | http://www.ejgta.org/index.php/ejgta/article/view/210 |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|