scientific article; zbMATH DE number 5717189
From MaRDI portal
Publication:3565861
Recommendations
- On open neighborhood locating-dominating in graphs
- Open neighborhood locating-dominating in trees
- Open neighborhood locating-domination for grid-like graphs
- Open-independent, open-locating-dominating sets
- Algorithmic aspects of open neighborhood location-domination in graphs
- Open locating-dominating sets in circulant graphs
- scientific article; zbMATH DE number 861343
- scientific article; zbMATH DE number 1735664
- Characterizing extremal graphs for open neighbourhood location-domination
- Maximum Covering Formulation for Open Locating Dominating Sets
Cited in
(61)- Fault-tolerant locating-dominating sets
- Bounds on the locating Roman domination number in trees
- Bounds on the locating-domination number and differentiating-total domination number in trees
- Characterizing extremal graphs for open neighbourhood location-domination
- Open locating-dominating sets in circulant graphs
- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
- Bounding the trace function of a hypergraph with applications
- Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs
- The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations
- Open-independent, open-locating-dominating sets in complementary prism graphs
- Extremal cubic graphs for fault-tolerant locating domination
- Linear-time algorithms for three domination-based separation problems in block graphs
- Set graphs. II. Complexity of set graph recognition and similar problems
- Binary locating-dominating sets in rotationally-symmetric convex polytopes
- Locating-dominating sets and identifying codes in graphs of girth at least 5
- Optimal open-locating-dominating sets in infinite triangular grids
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Fault-tolerant detectors for distinguishing sets in cubic graphs
- On redundant locating-dominating sets
- Open neighborhood locating-domination for grid-like graphs
- Locating mobile intruders using dominating sets
- Locating-domination and identification
- Algorithmic aspects of open neighborhood location-domination in graphs
- scientific article; zbMATH DE number 1281766 (Why is no real title available?)
- scientific article; zbMATH DE number 6889668 (Why is no real title available?)
- Maximum Covering Formulation for Open Locating Dominating Sets
- The binary locating-dominating number of some convex polytopes
- Open-independent, open-locating-dominating sets
- The open-locating-dominating number of some convex polytopes
- MOVABLE DIFFERENTIATING-DOMINATION IN GRAPHS
- ON MULTIPLE INTRUDER LOCATING DOMINATION IN INFINITE GRIDS
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
- My favorite domination conjectures in graph theory are bounded
- Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
- Some results on the open locating-total domination number in graphs
- On three domination-based identification problems in block graphs
- Bounds and extremal graphs for total dominating identifying codes
- Progress on fault-tolerant locating-dominating sets
- On the binary locating-domination number of regular and strongly-regular graphs
- Extremal Digraphs for open neighbourhood location-domination and identifying codes
- Open neighborhood locating-dominating in trees
- On Iiro Honkala's contributions to identifying codes
- On three domination-based identification problems in block graphs
- Fault-tolerant locating-dominating sets on the infinite tumbling block graph
- Optimal error-detection system for identifying codes
- Fault-tolerant locating-dominating sets with error-correction
- Red-blue unshared dominators
- Fault-tolerant detection systems on the infinite King grid
- On full-separating sets and related codes in graphs
- On the minimum locating number of graphs with a given order
- Open-locating dominating number for flower snarks
- On open-separating dominating codes in graphs
- On full-separating sets in graphs
- Fault-tolerant identifying codes in special classes of graphs
- Optimal error-detecting open-locating-dominating set on the infinite triangular grid
- Error-correcting open-locating-dominating sets
- Open-separating dominating codes in graphs
- Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
- Fault-tolerant locating-dominating sets on the infinite king grid
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- Fault tolerant detectors for distinguishing sets in graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565861)
