Computation of edge resolvability of benzenoid tripod structure
type: Item
instance of: scholarly article
title: Computation of edge resolvability of benzenoid tripod structure
zbMATH Open document ID: 1477.05055
DOI: 10.1155/2021/9336540
author: Ali Ahmad
author: Sadia Husain
author: Muhammad Azeem
author: Kashif Elahi
author: Muhammad Kamran Siddiqui
published in: Journal of Mathematics
publication date: 2021-11-24T00:00:00Z
review text: Summary: In chemistry, graphs are commonly used to show the structure of chemical compounds, with nodes and edges representing the atom and bond types, respectively. Edge resolving set \(\lambda_e\) is an ordered subset of nodes of a graph \(C\), in which each edge of \(C\) is distinctively determined by its distance vector to the nodes in \(\lambda\). The cardinality of a minimum edge resolving set is called the edge metric dimension of \(C\). An edge resolving set \(L_{e, f}\) of \(C\) is fault-tolerant if \(\lambda_{e, f}\setminus b\) is also an edge resolving set, for every \(b\) in \(\lambda_{e, f}\). Resolving set allows obtaining a unique representation for chemical structures. In particular, they were used in pharmaceutical research for discovering patterns common to a variety of drugs. In this paper, we determine the exact edge metric and fault-tolerant edge metric dimension of benzenoid tripod structure and proved that both parameters are constant.
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 92E10
Mathematics Subject Classification ID: 05C92
zbMATH DE Number: 7433106
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2021/9336540
OpenAlex ID: W3207150429
cites work: On the edge metric dimension of convex polytopes and its related graphs
cites work: The comparative analysis of metric and edge metric dimension of some subdivisions of the wheel graph
cites work: Vertices, edges, distances and metric dimension in graphs
cites work: Edge version of metric dimension and doubly resolving sets of the necklace graph
cites work: The \(k\)-size edge metric dimension of graphs
cites work: On the edge metric dimension of graphs
cites work: Graphs with the edge metric dimension smaller than the metric dimension
cites work: Edge metric dimension of some generalized Petersen graphs
cites work: Edge metric dimension of \(k\) multiwheel graph
cites work: Q4075485
cites work: Q4119237
cites work: The partition dimension of a graph
cites work: Resolvability in graphs and the metric dimension of a graph
cites work: Structure-activity maps for visualizing the graph variables arising in drug design
cites work: Landmarks in graphs
cites work: A Combinatory Detection Problem
cites work: On minimum metric dimension of honeycomb networks
cites work: On Metric Generators of Graphs
cites work: Computing metric dimension and metric basis of 2D lattice of alpha-boron nanotubes
cites work: Approximation complexity of metric dimension problem
cites work: Q4198056
cites work: Uniquely identifying the edges of a graph: the edge metric dimension
cites work: The locating number of hexagonal Möbius ladder network
description: scientific article; zbMATH DE number 7433106