scientific article; zbMATH DE number 3906528
From MaRDI portal
Publication:3684148
Recommendations
- On locating-domination in graphs
- A note on the locating-total domination in graphs
- On metric-location-domination number of graphs
- Locating-total domination in graphs
- On the locatic number of graphs
- Location domination of circulant graphs. II
- A note on the complexity of locating-total domination in graphs
- On global location-domination in graphs
- Domination and location in acyclic graphs
- On locating-dominating set of regular graphs
Cited in
(62)- Identification of points using disks
- On regular and new types of codes for location-domination
- Locating-dominating sets in hypergraphs
- Computing the \(k\)-metric dimension of graphs
- On the density of identifying codes in the square lattice
- On a conjecture regarding identification in Hamming graphs
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
- On locating-dominating set of regular graphs
- Improved lower bound for locating-dominating codes in binary Hamming spaces
- Bounding the trace function of a hypergraph with applications
- Locating-dominating sets: from graphs to oriented graphs
- On connected 3-\(\gamma_L\)-dot-critical graphs
- Covering codes of a graph associated with a finite vector space
- Locating-dominating codes in paths
- The solid-metric dimension
- Optimal bounds on codes for location in circulant graphs
- A note on the complexity of locating-total domination in graphs
- Locating-dominating sets of functigraphs
- Locating-paired-dominating sets in square grids
- On the ensemble of optimal dominating and locating-dominating codes in a graph
- On identifying codes that are robust against edge changes
- Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
- Locating domination in bipartite graphs and their complements
- Extremal graphs for the identifying code problem
- An optimal locating-dominating set in the infinite triangular grid
- Locating and identifying codes in circulant networks
- Locating sensors in paths and cycles: the case of 2-identifying codes
- A linear algorithm for minimum 1-identifying codes in oriented trees
- Locating and total dominating sets in trees
- Liar's domination
- Locating-total dominating sets in twin-free graphs: a conjecture
- Location-domination in line graphs
- Location-2-Domination for Product of Graphs
- Locating-domination and identification
- Identifying codes in hereditary classes of graphs and VC-dimension
- The determining number of a Cartesian product
- On the size of identifying codes in triangle-free graphs
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
- Neighbourhood complexity of graphs of bounded twin-width
- The dominating partition dimension and locating-chromatic number of graphs
- On three domination-based identification problems in block graphs
- Open neighborhood locating-dominating in trees
- On Iiro Honkala's contributions to identifying codes
- On three domination-based identification problems in block graphs
- Optimal local identifying and local locating-dominating codes
- Parameterized algorithms for locating-dominating sets
- On the minimum locating number of graphs with a given order
- Identifying codes in triangle-free graphs of bounded maximum degree
- On the density of (1, )-locating-dominating codes in the infinite square grid
- New optimal results on codes for location in graphs
- Independent location-domination number of graphs
- On (1, l)-locating-dominating codes in infinite triangular grid
- New results on vertices that belong to every minimum locating-dominating code
- Domination and location in twin-free digraphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- On locating--dominating sets in infinite grids
- On a new class of identifying codes in graphs
- Locating-dominating sets in twin-free graphs
- Location-domination and matching in cubic graphs
- Discriminating codes in (bipartite) planar graphs
- Locating and paired-dominating sets in graphs
- Determining sets, resolving sets, and the exchange property
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 Q3684148)
