Edge Metric Dimension of Silicate Networks

2024/06/11 by S. Prabhu, Prabhu, S., T. Jenifer Janany +1 · 1 citation
Mathematics · #05C12 #05C69 #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications

paper · pdf · doi:10.48550/arxiv.2406.07019

openalex publication_date 2024/06/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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.

Cited by

• Computing fault-tolerant metric dimension of graphs using their primary subgraphs

Related

• Metric and Edge Metric Dimension of Zigzag Edge Coronoid Fused with Starphene
• Uniquely identifying the edges of a graph: the edge metric dimension
• Metric dimensions of generalized Sierpiński graphs over squares
• A note on the metric and edge metric dimensions of 2-connected graphs
• Edge metric dimension of some graph operations