Pages that link to "Item:Q4828807"
From MaRDI portal
The following pages link to The independent resolving number of a graph (Q4828807):
Displaying 24 items.
- Closed formulae for the local metric dimension of corona product graphs (Q283660) (← links)
- The simultaneous metric dimension of families composed by lexicographic product graphs (Q343771) (← links)
- On the local metric dimension of corona product graphs (Q726508) (← links)
- Weak total resolvability in graphs (Q907841) (← links)
- Uniquely identifying the edges of a graph: the edge metric dimension (Q1627862) (← links)
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144) (← links)
- The metric dimension of some generalized Petersen graphs (Q1727099) (← links)
- Computing the \(k\)-metric dimension of graphs (Q1735142) (← links)
- Mixed metric dimension of graphs (Q1740116) (← links)
- On the strong metric dimension of corona product graphs and join graphs (Q1949107) (← links)
- The \(k\)-size edge metric dimension of graphs (Q1983360) (← links)
- The locating number of hexagonal Möbius ladder network (Q2053208) (← links)
- Link dimension and exact construction of graphs from distance vectors (Q2065779) (← links)
- On metric dimension of plane graphs with \(\frac{m}{2}\) number of 10 sided faces (Q2082171) (← links)
- On adjacency metric dimension of some families of graph (Q2158451) (← links)
- On the geodesic identification of vertices in convex plane graphs (Q2217853) (← links)
- The vertex-edge resolvability of some wheel-related graphs (Q2240172) (← links)
- The Local metric dimension of the lexicographic product of graphs (Q2272639) (← links)
- Computing the metric dimension for chain graphs (Q2346556) (← links)
- The local metric dimension of strong product graphs (Q2631070) (← links)
- The adjacency dimension of graphs (Q5089704) (← links)
- Computing vertex resolvability of some regular planar graphs (Q6132231) (← links)
- Fault-tolerant resolvability of some graphs of convex polytopes (Q6169631) (← links)
- The fault‐tolerant beacon set of hexagonal Möbius ladder network (Q6184060) (← links)