Pages that link to "Item:Q3439322"
From MaRDI portal
The following pages link to On the metric dimension of some families of graphs (Q3439322):
Displayed 17 items.
- The partition dimension of strong product graphs and Cartesian product graphs (Q397144) (← links)
- On the strong metric dimension of Cartesian and direct products of graphs (Q400431) (← links)
- On the metric dimension of circulant graphs (Q427599) (← links)
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes (Q440965) (← links)
- On the constant metric dimension of generalized Petersen graphs \(P(n, 4)\) (Q477810) (← links)
- A note on the partition dimension of Cartesian product graphs (Q613309) (← links)
- On families of convex polytopes with constant metric dimension (Q623216) (← links)
- On the metric dimension of corona product graphs (Q639103) (← links)
- Computing the metric dimension of graphs by genetic algorithms (Q849088) (← links)
- Complexity results related to monophonic convexity (Q987671) (← links)
- Computing minimal doubly resolving sets of graphs (Q1013386) (← links)
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems (Q1926742) (← links)
- On metric dimension of some rotationally symmetric graphs (Q1952730) (← links)
- On the partition dimension of a class of circulant graphs (Q2446592) (← links)
- On the partition dimension of trees (Q2636811) (← links)
- On the metric dimension of some families of graphs (Q3439322) (← links)
- The metric dimension of the lexicographic product of graphs (Q5894950) (← links)