5 citations · 11 across the 10 of their papers we have counts for
11 papers
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 Locating-Dominating sets with Error-correction
Devin Jean, Suk Seo
A locating-dominating set is a subset of vertices representing "detectors" in a graph G; each detector monitors its closed neighborhood and can distinguish its own location from it…
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…
Error-correcting 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 p…
Graphical parameters for classes of tumbling block graphs
Suk J. Seo, Peter J. Slater
The infinite tumbling block graph is a bipartite graph, where each vertex in one partite set is of degree 3 and each vertex in the other partite set is of degree 6. It is a 2-dimen…
The NP-completeness of Redundant Open-Locating-Dominating Set
Robert Dohner, Suk Jai Seo
For a graph G, a dominating set D is a subset of vertices in G where each of the vertices in G is in D or adjacent to some vertex in D. An open-locating-dominating (OLD) set models…
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…