2023/06/21 by Devin Jean, Jean, Devin, Suk Min Seo +1
Computer Science · #Advanced Graph Theory Research #Optimization and Search Problems
paper · pdf · doi:10.48550/arxiv.2306.12583
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 such that each pair of distinct vertices in G have distinct set of open-neighbors in S. We consider a type of a fault-tolerant open-locating dominating set called error-detecting open-locating-dominating sets. We present more results on the topic including its NP-completeness proof, extremal graphs, and a characterization of cubic graphs that permit an error-detecting open-locating-dominating set.