Pages that link to "Item:Q440965"

The following pages link to Minimal doubly resolving sets and the strong metric dimension of some convex polytopes (Q440965):

Displaying 30 items.

• On the metric dimension of two families of convex polytopes (Q258375) (← links)
• Computing the metric dimension of wheel related graphs (Q279611) (← links)
• Closed formulae for the strong metric dimension of lexicographic product graphs (Q339497) (← links)
• On the strong partition dimension of graphs (Q405298) (← links)
• The simultaneous strong metric dimension of graph families (Q726509) (← links)
• Approximation for the minimum cost doubly resolving set problem (Q896151) (← links)
• Edge version of metric dimension and doubly resolving sets of the necklace graph (Q1634709) (← links)
• Strong resolving graphs: the realization and the characterization problems (Q1693153) (← links)
• The strong metric dimension of the power graph of a finite group (Q1706126) (← links)
• On the fault-tolerant metric dimension of convex polytopes (Q2007513) (← links)
• Computation of the double metric dimension in convex polytopes (Q2051724) (← links)
• A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem (Q2065777) (← links)
• Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs (Q2082215) (← links)
• The doubly metric dimension of cylinder graphs and torus graphs (Q2107131) (← links)
• The equidistant dimension of graphs (Q2147613) (← links)
• Computing minimal doubly resolving sets and the strong metric dimension of the layer sun graph and the line graph of the layer sun graph (Q2210246) (← links)
• On the geodesic identification of vertices in convex plane graphs (Q2217853) (← links)
• On the fault-tolerant metric dimension of certain interconnection networks (Q2318326) (← links)
• Metric-locating-dominating sets of graphs for constructing related subsets of vertices (Q2333263) (← links)
• Resolvability and fault-tolerant resolvability structures of convex polytopes (Q2333791) (← links)
• Binary locating-dominating sets in rotationally-symmetric convex polytopes (Q2337871) (← links)
• On the strong metric dimension of tetrahedral diamond lattice (Q2516507) (← links)
• The difference between several metric dimension graph invariants (Q2696607) (← links)
• Variable neighborhood search for the strong metric dimension problem (Q2840752) (← links)
• The binary locating-dominating number of some convex polytopes (Q4604525) (← links)
• The convex and weak convex domination number of convex polytopes (Q5101858) (← links)
• Fault-tolerant strong metric dimension of graphs (Q6059083) (← links)
• On the metric determination of linear dependence graph (Q6078839) (← links)
• The strong metric dimension of some generalized Petersen graphs (Q6138258) (← links)
• Metric Properties of Non-Commuting Graph Associated to Two Groups (Q6169948) (← links)