The following pages link to (Q4464781):
Displaying 50 items.
- Computing the metric dimension of wheel related graphs (Q279611) (← links)
- The fractional metric dimension of graphs (Q411666) (← links)
- The (weighted) metric dimension of graphs: hard and easy cases (Q494798) (← links)
- On randomly \(k\)-dimensional graphs (Q550450) (← links)
- Approximation for the minimum cost doubly resolving set problem (Q896151) (← links)
- Discovery of network properties with all-shortest-paths queries (Q962167) (← links)
- Edge version of metric dimension and doubly resolving sets of the necklace graph (Q1634709) (← links)
- On the locating chromatic number of certain barbell graphs (Q1728997) (← links)
- The weighted 2-metric dimension of trees in the non-landmarks model (Q1751125) (← links)
- On the metric dimension of infinite graphs (Q1759836) (← links)
- Fault-tolerant resolvability in some classes of line graphs (Q2004093) (← links)
- Resolvability in subdivision of circulant networks \(C_n[1, k]\) (Q2004177) (← links)
- On the fault-tolerant metric dimension of convex polytopes (Q2007513) (← links)
- Mixed metric dimension of graphs with edge disjoint cycles (Q2030239) (← links)
- Maker-breaker resolving game (Q2045245) (← links)
- On metric dimension of plane graphs with \(\frac{m}{2}\) number of 10 sided faces (Q2082171) (← links)
- Power graphs and exchange property for resolving sets (Q2111701) (← links)
- On the 2-metric resolvability of graphs (Q2132227) (← links)
- The effect of vertex and edge deletion on the edge metric dimension of graphs (Q2168730) (← links)
- Fault-tolerant metric dimension of generalized wheels and convex polytopes (Q2214773) (← links)
- On the edge metric dimension of convex polytopes and its related graphs (Q2292146) (← links)
- Fault-tolerant metric dimension of circulant graphs \(C_n(1,2,3)\) (Q2309413) (← links)
- On the fault-tolerant metric dimension of certain interconnection networks (Q2318326) (← links)
- Resolvability and fault-tolerant resolvability structures of convex polytopes (Q2333791) (← links)
- On strong metric dimension of graphs and their complements (Q2391996) (← links)
- Computing the metric dimension of convex polytopes generated by wheel related graphs (Q2400091) (← links)
- A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs (Q2403987) (← links)
- The \(k\)-metric dimension (Q2410025) (← links)
- On the strong metric dimension of tetrahedral diamond lattice (Q2516507) (← links)
- Discrepancies between metric dimension and partition dimension of a connected graph (Q2519818) (← links)
- Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks (Q2668378) (← links)
- Minimum weight resolving sets of grid graphs (Q2821114) (← links)
- FAULT-TOLERANT METRIC DIMENSION OF CIRCULANT GRAPHS (Q3388622) (← links)
- Discovery of Network Properties with All-Shortest-Paths Queries (Q3511392) (← links)
- Bounds on the sum of domination number and metric dimension of graphs (Q4554552) (← links)
- On the metric dimension and diameter of circulant graphs with three jumps (Q4603875) (← links)
- New resolvability parameters of graphs (Q4956222) (← links)
- The partition dimension of a subdivision of a homogeneous firecracker (Q4958010) (← links)
- Edge version of metric dimension for the families of grid graphs and generalized prism graphs (Q4965906) (← links)
- The fractional k-metric dimension of graphs (Q5028802) (← links)
- Some family of distance pattern distinguishing graphs and realization results (Q5034560) (← links)
- On metric dimension of <i>P</i>(<i>n</i>, 2)ʘ<i>K</i><sub>1</sub> graph (Q5035113) (← links)
- Fault-tolerant metric dimension of <i>P</i>(<i>n</i>, 2)ʘ<i>K</i><sub>1</sub> graph (Q5035114) (← links)
- Vertex identification in trees (Q5051441) (← links)
- Solis Graphs and Uniquely Metric Basis Graphs (Q5056905) (← links)
- Graphs with constant adjacency dimension (Q5083854) (← links)
- (Q5094643) (← links)
- Different-Distance Sets in a Graph (Q5242947) (← links)
- On resolvability of a graph associated to a finite vector space (Q5377480) (← links)
- (Q5866382) (← links)
