Open-independent, open-locating-dominating sets
| Main Authors: | Seo, Suk J.; Computer Science Department, Middle Tennessee State University, Murfreesboro, TN 37132, U.S.A, Slater, Peter J.; Mathematical Sciences Department and Computer Science Department, University of Alabama in Huntsville, Huntsville, AL 35899, U.S.A |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2017
|
| Subjects: | |
| Online Access: |
http://www.ejgta.org/index.php/ejgta/article/view/210 http://www.ejgta.org/index.php/ejgta/article/view/210/pdf_47 |
Daftar Isi:
- 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 required to have a certain property for <D>, the subgraph induced by D (such as independence, paired, or connected). Recently the study of independent locating-dominating sets and independent identifying codes was initiated. Here we introduce the property of open-independence for open-locating-dominating sets.