28 citations · 77 across the 21 of their papers we have counts for
6 papers · 1 filter
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…
Multilateration of Random Networks with Community Structure
Richard D. Tillquist, Manuel E. Lladser
The minimal number of nodes required to multilaterate a network endowed with geodesic distance (i.e., to uniquely identify all nodes based on shortest path distances to the selecte…
The diameter of random Cayley digraphs of given degree
Primož Potočnik, Jozef Širáň, Jana Šiagiová +2
We consider random Cayley digraphs of order with uniformly distributed generating set of size . Specifically, we are interested in the asymptotics of the probability such a…
Mixed powers of generating functions
Manuel Lladser
Given an integer m>=1, let || || be a norm in R^{m+1} and let S denote the set of points with nonnegative coordinates in the unit sphere with respect to this norm. Consider for eac…
Uniform formulae for coefficients of meromorphic functions in two variables. Part I
Manuel Lladser
Uniform asymptotic formulae for arrays of complex numbers of the form , with and nonnegative integers, are provided as and converge to infinity at a comp…