  Metric dimension is an essential parameter in graph theory that aids in
addressing issues pertaining to information retrieval, localization, network
design, and chemistry through the identification of the least possible number
of elements necessary to identify the distances between vertices in a graph
uniquely. A variant of metric dimension, called the edge metric dimension
focuses on distinguishing the edges in a graph $G$, with a vertex subset. The
minimum possible number of vertices in such a set is denoted as $\dim_E(G)$.
This paper presents the precise edge metric dimension of silicate networks.
