14 citations · 29 across the 4 of their papers we have counts for
4 papers
Truncated Metric Dimension for Finite Graphs
Richard C. Tillquist, Rafael M. Frongillo, Manuel E. Lladser
A graph with geodesic distance is said to be resolved by a non-empty subset of its vertices when, for all vertices and , if fo…
Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and its Applications
Richard C. Tillquist, Rafael M. Frongillo, Manuel E. Lladser
The metric dimension of a graph is the smallest number of nodes required to identify all other nodes based on shortest path distances uniquely. Applications of metric dimension inc…
Metric Dimension
Richard C. Tillquist, Rafael M. Frongillo, Manuel E. Lladser
In this manuscript, we provide a concise review of the concept of metric dimension for both deterministic as well as random graphs. Algorithms to approximate this quantity, as well…
Resolvability of Hamming Graphs
Lucas Laird, Richard C. Tillquist, Stephen Becker +1
A subset of vertices in a graph is called resolving when the geodesic distances to those vertices uniquely distinguish every vertex in the graph. Here, we characterize the resolvab…