The following pages link to (Q4119237):
Displayed 50 items.
- Centroidal localization game (Q668034) (← links)
- Conditional resolvability of honeycomb and hexagonal networks (Q691636) (← links)
- Locating a robber on a graph (Q713142) (← links)
- Simultaneous resolvability in families of corona product graphs (Q723627) (← links)
- The \(k\)-metric dimension of corona product graphs (Q726506) (← links)
- On the local metric dimension of corona product graphs (Q726508) (← links)
- The simultaneous strong metric dimension of graph families (Q726509) (← links)
- Network verification via routing table queries (Q743125) (← links)
- On the locating chromatic number of Kneser graphs (Q765319) (← links)
- The twin non-commuting graph of a group (Q777201) (← links)
- Metric dimension and pattern avoidance in graphs (Q777351) (← 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)
- Bounds on the domination number and the metric dimension of co-normal product of graphs (Q824651) (← links)
- On the metric dimension of generalized tensor product of interval with paths and cycles (Q827175) (← links)
- Computing the metric dimension of graphs by genetic algorithms (Q849088) (← links)
- Destroying automorphisms by fixing nodes (Q856873) (← links)
- The strong metric dimension of graphs and digraphs (Q868391) (← links)
- Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
- On the number of resolving pairs in graphs (Q897274) (← links)
- The simultaneous metric dimension of graph families (Q897612) (← links)
- Extending the metric dimension to graphs with missing edges (Q897908) (← links)
- Locating-dominating codes: bounds and extremal cardinalities (Q902474) (← links)
- Weak total resolvability in graphs (Q907841) (← links)
- Extremal problems on detectable colorings of trees (Q952656) (← links)
- On minimum metric dimension of honeycomb networks (Q954950) (← links)
- Locating and paired-dominating sets in graphs (Q967383) (← links)
- Computing minimal doubly resolving sets of graphs (Q1013386) (← links)
- deBruijn-like sequences and the irregular chromatic number of paths and cycles (Q1045102) (← links)
- Liar's domination in graphs (Q1045132) (← links)
- Graphs of order \(n\) with locating-chromatic number \(n-1\) (Q1402068) (← links)
- Resolvability and the upper dimension of graphs (Q1569967) (← links)
- Resolvability in graphs and the metric dimension of a graph (Q1582071) (← links)
- Localization game on geometric and planar graphs (Q1627842) (← links)
- Uniquely identifying the edges of a graph: the edge metric dimension (Q1627862) (← links)
- Edge version of metric dimension and doubly resolving sets of the necklace graph (Q1634709) (← links)
- Symmetry properties of resolving sets and metric bases in hypercubes (Q1677292) (← links)
- Locating-dominating sets in hypergraphs (Q1677551) (← links)
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144) (← links)
- The strong metric dimension of the power graph of a finite group (Q1706126) (← links)
- Error-correcting codes from \(k\)-resolving sets (Q1717187) (← links)
- The metric dimension of some generalized Petersen graphs (Q1727099) (← links)
- On graphs with the maximum edge metric dimension (Q1730253) (← links)
- Computing the \(k\)-metric dimension of graphs (Q1735142) (← 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)
- Mixed metric dimension of graphs (Q1740116) (← links)
- On the metric dimension of incidence graphs (Q1744744) (← links)
- \(k\)-metric antidimension: a privacy measure for social graphs (Q1750516) (← links)
- The weighted 2-metric dimension of trees in the non-landmarks model (Q1751125) (← links)