On open neighborhood locating-dominating in graphs
<p>A set D of vertices in a graph G = (V (G), E(G)) is an open neighborhood locating-dominating set (OLD-set) for G if for every two vertices u, v of V (G) the sets N(u) ∩ D and N(v) ∩ D are non-empty and different. The open neighborhood locating-dominating number OLD(G) is the minimum cardina...
| Autors principals: | , , , |
|---|---|
| Format: | Article |
| Idioma: | English |
| Publicat: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2014-10-01
|
| Col·lecció: | Electronic Journal of Graph Theory and Applications |
| Matèries: | |
| Accés en línia: | https://www.ejgta.org/index.php/ejgta/article/view/63 |