Beschreibung:
<jats:title>Abstract</jats:title><jats:p>The metric on a connected graph <jats:italic>G</jats:italic> is a mapping which assigns to each pair of vertices in <jats:italic>G</jats:italic> the length of a shortest path between <jats:italic>u</jats:italic> and <jats:italic>v</jats:italic>. In this article, we consider the linear dependence graph associated with a finite dimensional vector space and determine its metric properties, namely, the center, the periphery, metric‐degree sequence, metric‐degree polynomial, metric dimension, connected metric dimension, local metric dimension, strong metric dimension, and the metric polynomial.</jats:p>