Computation of edge resolvability of benzenoid tripod structure
From MaRDI portal
Publication:2051719
DOI10.1155/2021/9336540zbMath1477.05055OpenAlexW3207150429MaRDI QIDQ2051719
Ali Ahmad, Kashif Elahi, Muhammad Kamran Siddiqui, Sadia Husain, Muhammad Azeem
Publication date: 24 November 2021
Published in: Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2021/9336540
Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Connectivity (05C40) Chemical graph theory (05C92)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation complexity of metric dimension problem
- Vertices, edges, distances and metric dimension in graphs
- On minimum metric dimension of honeycomb networks
- Resolvability in graphs and the metric dimension of a graph
- Uniquely identifying the edges of a graph: the edge metric dimension
- Edge version of metric dimension and doubly resolving sets of the necklace graph
- The partition dimension of a graph
- The \(k\)-size edge metric dimension of graphs
- The locating number of hexagonal Möbius ladder network
- On the edge metric dimension of graphs
- Edge metric dimension of \(k\) multiwheel graph
- Graphs with the edge metric dimension smaller than the metric dimension
- Edge metric dimension of some generalized Petersen graphs
- On the edge metric dimension of convex polytopes and its related graphs
- Computing metric dimension and metric basis of 2D lattice of alpha-boron nanotubes
- Landmarks in graphs
- Structure-activity maps for visualizing the graph variables arising in drug design
- The comparative analysis of metric and edge metric dimension of some subdivisions of the wheel graph
- On Metric Generators of Graphs
- A Combinatory Detection Problem
This page was built for publication: Computation of edge resolvability of benzenoid tripod structure