On redundant locating-dominating sets

DOI10.1016/J.DAM.2023.01.023MaRDI QIDQ2686136zbMATH OpenOpenAlexFDO

Authors Devin C. Jean, Suk J. Seo

Publication date 24 February 2023

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2209.04500

zbMATH Keywords

densitycharacterizationNP-completelocating-dominating setsfault-tolerantextremal treesredundant locating-dominating sets

Mathematics Subject Classification ID

Theory of computing (68Qxx) Graph theory (05Cxx) Mathematical programming (90Cxx)

Recommendations

• Progress on fault-tolerant locating-dominating sets
• Fault-tolerant locating-dominating sets
• Bounds of fault-tolerant locating-dominating sets
• Fault tolerant detectors for distinguishing sets in graphs
• Independent locating-dominating sets and identifying codes in graphs

Cites work

• scientific article; zbMATH DE number 5942290 (Why is no real title available?)
• scientific article; zbMATH DE number 5717189 (Why is no real title available?)
• scientific article; zbMATH DE number 4053685 (Why is no real title available?)
• scientific article; zbMATH DE number 4070954 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 6889668 (Why is no real title available?)
• Determining sets, resolving sets, and the exchange property
• Domination and location in acyclic graphs
• Extremal cubic graphs for fault-tolerant locating domination
• Fault tolerant detectors for distinguishing sets in graphs
• Fault-tolerant locating-dominating sets
• Fault-tolerant metric dimension of graphs
• Generalized set dominating and separating systems
• Locating-dominating sets in twin-free graphs
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
• Nordhaus-Gaddum bounds for locating domination
• On a new class of codes for identifying vertices in graphs
• Progress on fault-tolerant locating-dominating sets
• The metric dimension of the lexicographic product of graphs
• Watching systems in graphs: an extension of identifying codes

Cited in

(9)

• Progress on fault-tolerant locating-dominating sets
• Fault tolerant detectors for distinguishing sets in graphs
• Fault-tolerant locating-dominating sets with error-correction
• Fault-tolerant detectors for distinguishing sets in cubic graphs
• Fault-tolerant locating-dominating sets on the infinite tumbling block graph
• Bounds of fault-tolerant locating-dominating sets
• On Redundant Locating-Dominating Sets
• Fault-tolerant locating-dominating sets
• On locating--dominating sets in infinite grids

This page was built for publication: On redundant locating-dominating sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2686136)