The following pages link to (Q3803159):
Displaying 50 items.
- Computing the metric dimension of wheel related graphs (Q279611) (← links)
- \(k\)-metric resolvability in graphs (Q283685) (← links)
- LD-graphs and global location-domination in bipartite graphs (Q283710) (← links)
- The difference between the metric dimension and the determining number of a graph (Q298637) (← links)
- Locating-total dominating sets in twin-free graphs: a conjecture (Q311495) (← links)
- A polyhedral approach to locating-dominating sets in graphs (Q324734) (← links)
- Location-domination in line graphs (Q329538) (← links)
- Coloring, location and domination of corona graphs (Q372395) (← links)
- On the strong metric dimension of Cartesian and direct products of graphs (Q400431) (← links)
- On the metric dimension of circulant graphs (Q427599) (← links)
- Locating-total domination in graphs (Q442212) (← links)
- Approximation complexity of metric dimension problem (Q450564) (← links)
- Locating-total domination in claw-free cubic graphs (Q456648) (← links)
- Computing the metric dimension of a graph from primary subgraphs (Q503686) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- On families of convex polytopes with constant metric dimension (Q623216) (← links)
- Open neighborhood locating-dominating in trees (Q628345) (← links)
- Identifying codes and locating-dominating sets on paths and cycles (Q642979) (← links)
- Metric dimension and \(R\)-sets of connected graphs (Q659718) (← links)
- Centroidal localization game (Q668034) (← links)
- Conditional resolvability of honeycomb and hexagonal networks (Q691636) (← links)
- The \(k\)-metric dimension of corona product graphs (Q726506) (← links)
- Domination and location in twin-free digraphs (Q777359) (← links)
- On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs (Q786037) (← links)
- The metric dimension of Cayley digraphs (Q817748) (← links)
- On locating--dominating sets in infinite grids (Q819007) (← links)
- On the metric dimension of generalized tensor product of interval with paths and cycles (Q827175) (← links)
- On a new class of identifying codes in graphs (Q845971) (← links)
- The strong metric dimension of graphs and digraphs (Q868391) (← links)
- Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← links)
- Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
- Locating-dominating codes: bounds and extremal cardinalities (Q902474) (← links)
- Locating-dominating sets in twin-free graphs (Q906432) (← links)
- Location-domination and matching in cubic graphs (Q906465) (← links)
- Star complements in regular graphs: old and new results (Q962113) (← links)
- Locating and paired-dominating sets in graphs (Q967383) (← links)
- Upper bounds for binary identifying codes (Q1012154) (← links)
- On \(r\)-locating-dominating sets in paths (Q1024298) (← links)
- Liar's domination in graphs (Q1045132) (← links)
- Graphs of order \(n\) with locating-chromatic number \(n-1\) (Q1402068) (← links)
- Well-located graphs: A collection of well-covered ones (Q1422424) (← links)
- Resolvability and the upper dimension of graphs (Q1569967) (← links)
- Resolvability in graphs and the metric dimension of a graph (Q1582071) (← links)
- Identification of points using disks (Q1618247) (← links)
- On regular and new types of codes for location-domination (Q1671339) (← links)
- Locating-dominating sets in hypergraphs (Q1677551) (← links)
- Bounds on the locating Roman domination number in trees (Q1692624) (← links)
- Bounds on the locating-domination number and differentiating-total domination number in trees (Q1708392) (← links)
- Computing metric dimension of compressed zero divisor graphs associated to rings (Q1737405) (← links)
- Sharp bounds for partition dimension of generalized Möbius ladders (Q1738248) (← links)