Progress on fault-tolerant locating-dominating sets

DOI10.1142/s179383092250080xzbMath1516.05172OpenAlexW4223589371MaRDI QIDQ6174163

Devin C. Jean, Suk J. Seo

Publication date: 14 July 2023

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s179383092250080x

zbMATH Keywords

NP-completenesscubic graphslocating-dominating setsfault-tolerantdistinguishing seterror-detecting locating-dominating sets

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

On redundant locating-dominating sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Open neighborhood locating-dominating in trees
• Fault tolerant detectors for distinguishing sets in graphs
• Location-domination and matching in cubic graphs
• Fault-tolerant locating-dominating sets
• Fault-tolerant detectors for distinguishing sets in cubic graphs
• On redundant locating-dominating sets
• Identifying codes and watching systems in Kneser graphs
• MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS
• Domination and location in acyclic graphs
• On a new class of codes for identifying vertices in graphs
• r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube
• Minimum identifying codes in some graphs differing by matchings
• TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET
• The Generation of Fullerenes

This page was built for publication: Progress on fault-tolerant locating-dominating sets