M. Vázquez

Default-Distance Entropy and Metric Dimension in Finite Geometries

A resolving set in a graph is a set of landmarks whose distance vectors distinguish all vertices. We use information theory to prove lower bounds for metric dimension and class dimension in distance-regular graphs and association schemes arising from finite geometry. The core idea is that, for a fixed landmark, a rando...