Identifying and locating-dominating codes on chains and cycles
From MaRDI portal
(Redirected from Publication:1883609)
Recommendations
- Identifying codes and locating-dominating sets on paths and cycles
- Locating-dominating codes in cycles
- Locating-domination and identifying codes in trees
- Approximability of identifying codes and locating-dominating codes
- Identifying and locating-dominating codes: NP-completeness results for directed graphs
- Locating-dominating codes in paths
- Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs
- Independent locating-dominating sets and identifying codes in graphs
- Locating and identifying codes in circulant graphs
- Identifying and locating-dominating codes in (random) geometric networks
Cites work
- 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 2147927 (Why is no real title available?)
- scientific article; zbMATH DE number 861343 (Why is no real title available?)
- Identifying codes with small radius in some infinite regular graphs
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- On a new class of codes for identifying vertices in graphs
- On identification in \(\mathbb Z^2\) using translates of given patterns
- The minimum density of an identifying code in the king lattice.
Cited in
(75)- Locating-dominating codes in cycles
- Bounds on the identifying codes in trees
- Covering codes of a graph associated with a finite vector space
- New results on variants of covering codes in Sierpiński graphs
- Locating sensors in paths and cycles: the case of 2-identifying codes
- On the number of optimal identifying codes in a twin-free graph
- Revisiting and improving upper bounds for identifying codes
- On Stronger Types of Locating-dominating Codes
- LD-graphs and global location-domination in bipartite graphs
- Liar's domination
- On the size of identifying codes in triangle-free graphs
- Locating-paired-dominating sets in square grids
- Locating vertices using codes
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- Locating-dominating sets and identifying codes in graphs of girth at least 5
- Minimum identifying codes in some graphs differing by matchings
- Identifying codes and locating-dominating sets on paths and cycles
- Polyhedra associated with identifying codes in graphs
- Progress on the description of identifying code polyhedra for some families of split graphs
- Optimal identifying codes in cycles and paths
- Locating and identifying codes in circulant graphs
- On two variations of identifying codes
- Solving Two Conjectures regarding Codes for Location in Circulant Graphs
- An optimal locating-dominating set in the infinite triangular grid
- Locating-dominating codes: bounds and extremal cardinalities
- Optimal bounds on codes for location in circulant graphs
- Locating-domination and identification
- Locating domination in bipartite graphs and their complements
- On three domination-based identification problems in block graphs
- Strong identification codes for graphs
- A linear-time algorithm for the identifying code problem on block graphs
- On locating-dominating codes for locating large numbers of vertices in the infinite king grid
- Fault tolerant detectors for distinguishing sets in graphs
- Bound of \(r\)-identifying and \(r\)-locating-dominating codes in the Kronecker product graph of \(cy_n\) and \(\overline{k}_2\)
- A polyhedral approach to locating-dominating sets in graphs
- Watching systems in graphs: an extension of identifying codes
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code
- Fault-tolerant detectors for distinguishing sets in cubic graphs
- Open locating-dominating sets in circulant graphs
- Open-independent, open-locating-dominating sets
- Optimal identifying codes in the infinite 3-dimensional king grid
- Exact values for three domination-like problems in circular and infinite grid graphs of small height
- Identifying codes in the direct product of a complete graph and some special graphs
- Partial linear spaces and identifying codes
- Identification in \(\mathbb Z^2\) using Euclidean balls
- Linear-time algorithms for three domination-based separation problems in block graphs
- The compared costs of domination location-domination and identification
- The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations
- Complexity results for identifying codes in planar graphs
- Minimum sizes of identifying codes in graphs differing by one edge
- Identifying codes of the direct product of two cliques
- Identifying codes of corona product graphs
- Optimal identifying codes of two families of Cayley graphs
- Locating-dominating sets of functigraphs
- Identifying codes of cycles
- A linear algorithm for minimum 1-identifying codes in oriented trees
- New results of identifying codes in product graphs
- An extension of locating-total domination problem and its complexity
- Locating-dominating sets in hypergraphs
- Locating and identifying codes in dihedral graphs
- Locating and identifying codes in circulant networks
- Minimum sizes of identifying codes in graphs differing by one vertex
- Identifying codes of cycles with odd orders
- Extremal graphs for the identifying code problem
- Improved upper bounds for identifying codes in n-dimensional q-ary cubes
- On \(r\)-locating-dominating sets in paths
- On identifying codes that are robust against edge changes
- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
- Commutative rings introduce a class of identifiable graphs
- On locating-dominating set of regular graphs
- Identifying codes in vertex-transitive graphs and strongly regular graphs
- Locating-dominating codes in paths
- On locating--dominating sets in infinite grids
- Extension of universal cycles for globally identifying colorings of cycles
This page was built for publication: Identifying and locating-dominating codes on chains and cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1883609)
