Pages that link to "Item:Q3439322"

The following pages link to On the metric dimension of some families of graphs (Q3439322):

Displaying 50 items.

• On the metric dimension of two families of convex polytopes (Q258375) (← links)
• A linear time algorithm for metric dimension of cactus block graphs (Q278723) (← links)
• On the metric dimension of circulant and Harary graphs (Q298410) (← links)
• 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)
• Comparing the metric and strong dimensions of graphs (Q507581) (← 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)
• The \(k\)-metric dimension of corona product graphs (Q726506) (← 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)
• The simultaneous metric dimension of graph families (Q897612) (← links)
• Complexity results related to monophonic convexity (Q987671) (← links)
• Computing minimal doubly resolving sets of graphs (Q1013386) (← links)
• Uniquely identifying the edges of a graph: the edge metric dimension (Q1627862) (← links)
• Symmetry properties of resolving sets and metric bases in hypercubes (Q1677292) (← links)
• The metric dimension of some generalized Petersen graphs (Q1727099) (← links)
• Sharp bounds for partition dimension of generalized Möbius ladders (Q1738248) (← links)
• Mixed metric dimension of graphs (Q1740116) (← 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)
• Link dimension and exact construction of graphs from distance vectors (Q2065779) (← links)
• \(l\)-clique metric dimension of graphs (Q2091129) (← links)
• The threshold dimension and irreducible graphs (Q2107754) (← links)
• On some plane graphs and their metric dimension (Q2114667) (← links)
• Truncated metric dimension for finite graphs (Q2166223) (← links)
• Fault-tolerant metric dimension of generalized wheels and convex polytopes (Q2214773) (← links)
• On the status sequences of trees (Q2219062) (← links)
• Distance-based vertex identification in graphs: the outer multiset dimension (Q2286139) (← links)
• The simultaneous local metric dimension of graph families (Q2333540) (← links)
• Computing metric dimension and metric basis of 2D lattice of alpha-boron nanotubes (Q2333632) (← links)
• A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs (Q2403987) (← links)
• On the metric dimension of join of a graph with empty graph(\(O_p\)) (Q2413396) (← links)
• On the partition dimension of a class of circulant graphs (Q2446592) (← links)
• On the partition dimension of trees (Q2636811) (← links)
• On constant metric dimension of some generalized convex polytopes (Q2666438) (← links)
• The metric dimension of the join of paths and cycles (Q2695473) (← links)
• Minimum weight resolving sets of grid graphs (Q2821114) (← links)
• Computing the metric dimension of kayak paddles graph and cycles with chord (Q3388048) (← links)
• On metric dimension of plane graphs $\mathfrak{J}_{n}$, $\mathfrak{K}_{n}$ and $\mathfrak{L}_{n}$ (Q3390315) (← links)
• On the metric dimension of some families of graphs (Q3439322) (← links)
• On the metric dimension and diameter of circulant graphs with three jumps (Q4603875) (← links)
• (Q4987637) (← links)
• Certain Varieties of Resolving Sets of A Graph (Q5009133) (← links)
• A method to construct graphs with certain partition dimension (Q5009952) (← links)
• On metric dimension of <i>P</i>(<i>n</i>, 2)ʘ<i>K</i>₁ graph (Q5035113) (← links)