Paper Info
Title
Fault-Tolerant Detectors For Distinguishing Sets In Cubic Graphs
Abstract
Assume that G models a facility with a possible "intruder" (or a multiprocessor network with a possible malfunctioning processor). We consider placing (the minimum number of) detectors at vertices in G to precisely determine the location of the intruder. Various distinguishing set parameters have been defined based on the functionality of the detector. We characterize several types of fault-tolerant detectors identified for the open-locating-dominating sets and determine the bounds on the minimum size of these sets for cubic graphs. (C) 2021 Elsevier B.V. All rights reserved.
Year
DOI
Venue
2021
10.1016/j.dam.2021.01.008
DISCRETE APPLIED MATHEMATICS
Keywords
DocType
Volume
Domination, Distinguishing sets, Fault-tolerant detectors, Open-locating-dominating sets, Cubic graphs
Journal
293
ISSN
Citations 
PageRank 
0166-218X
0
0.34
References 
Authors
0
1
Name
Order
Citations
PageRank
Suk J. Seo1192.36