On redundant locating-dominating sets

DOI10.1016/j.dam.2023.01.023OpenAlexW4320168461MaRDI QIDQ2686136

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

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

Mathematics Subject Classification ID

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

Related Items (1)

Progress on fault-tolerant locating-dominating sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fault tolerant detectors for distinguishing sets in graphs
• Locating-dominating sets in twin-free graphs
• Determining sets, resolving sets, and the exchange property
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
• Fault-tolerant locating-dominating sets
• Extremal cubic graphs for fault-tolerant locating domination
• Nordhaus-Gaddum bounds for locating domination
• Watching systems in graphs: an extension of identifying codes
• Domination and location in acyclic graphs
• On a new class of codes for identifying vertices in graphs
• The metric dimension of the lexicographic product of graphs
• Progress on fault-tolerant locating-dominating sets

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