Pages that link to "Item:Q2519818"
From MaRDI portal
The following pages link to Discrepancies between metric dimension and partition dimension of a connected graph (Q2519818):
Displayed 22 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 strong partition dimension of graphs (Q405298) (← links)
- Approximation complexity of metric dimension problem (Q450564) (← links)
- A note on the partition dimension of Cartesian product graphs (Q613309) (← links)
- On the metric dimension of corona product graphs (Q639103) (← links)
- On the partition dimension of two-component graphs (Q1693652) (← links)
- Resolving dominating partitions in graphs (Q2026342) (← links)
- A note on \(k\)-metric dimensional graphs (Q2217503) (← links)
- Partition dimension of projective planes (Q2400970) (← links)
- Partition dimension of certain classes of series parallel graphs (Q2420571) (← links)
- On the partition dimension of a class of circulant graphs (Q2446592) (← links)
- On the metric dimension of HDN (Q2447530) (← links)
- On the partition dimension of trees (Q2636811) (← links)
- On the Metric Dimension of Infinite Graphs (Q2840509) (← links)
- On Approximation Complexity of Metric Dimension Problem (Q3000502) (← links)
- On some resolving partitions for the lexicographic product of two graphs (Q4976331) (← links)
- A method to construct graphs with certain partition dimension (Q5009952) (← links)
- Finite metric and 𝑘-metric bases on ultrametric spaces (Q5012126) (← links)
- The partition dimension of circulant graphs (Q5236142) (← links)
- Strong metric dimension of rooted product graphs (Q5739613) (← links)
- The metric dimension of the lexicographic product of graphs (Q5894950) (← links)