3 citations · 5 across the 9 of their papers we have counts for
7 papers · 1 filter
Open-locating-dominating sets with error correction
Devin Jean, Suk Seo
An open-locating-dominating set of a graph models a detection system for a facility with a possible "intruder" or a multiprocessor network with a possible malfunctioning processor.…
On Error-detecting Open-locating-dominating sets
Devin Jean, Suk Seo
An open-dominating set S for a graph G is a subset of vertices where every vertex has a neighbor in S. An open-locating-dominating set S for a graph G is an open-dominating set suc…
Fault-Tolerant Detection Systems on the King's Grid
Devin Jean, Suk Seo
A detection system, modeled in a graph, uses "detectors" on a subset of vertices to uniquely identify an "intruder" at any vertex. We consider two types of detection systems: open-…
On Redundant Locating-Dominating Sets
Devin Jean, Suk Seo
A locating-dominating set in a graph G is a subset of vertices representing "detectors" which can locate an "intruder" given that each detector covers its closed neighborhood and c…
Optimal Error-detection system for Identifying Codes
Devin Jean, Suk Seo
Assume that a graph models a detection system for a facility with a possible ``intruder," or a multiprocessor network with a possible malfunctioning processor. We consider the…
Fault-tolerant Locating-Dominating Sets on the Infinite King Grid
Devin Jean, Suk Seo
Let be a graph of a network system with vertices, , representing physical locations and edges, , representing informational connectivity. A \emph{locating-dominatin…
Fault-tolerant Identifying Codes in Special Classes of Graphs
Devin C. Jean, Suk J. Seo
A detection system, modeled in a graph, is composed of "detectors" positioned at a subset of vertices in order to uniquely locate an ``intruder" at any vertex. \emph{Identifying co…