The \(k\)-size edge metric dimension of graphs

DOI10.1155/2020/1023175zbMath1484.05059OpenAlexW3115187185MaRDI QIDQ1983360

Tanveer Iqbal, Muhammad Naeem Azhar, Syed Ahtsham ul Haq Bokhary

Publication date: 10 September 2021

Published in: Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/1023175

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Related Items (1)

Computation of edge resolvability of benzenoid tripod structure

Cites Work

• Unnamed Item
• On classes of regular graphs with constant metric dimension
• Resolvability and the upper dimension of graphs
• Resolvability in graphs and the metric dimension of a graph
• Uniquely identifying the edges of a graph: the edge metric dimension
• Edge metric dimension of some generalized Petersen graphs
• Landmarks in graphs
• Base size, metric dimension and other invariants of groups and graphs
• On the Metric Dimension of Cartesian Products of Graphs
• Structure-activity maps for visualizing the graph variables arising in drug design
• The independent resolving number of a graph

This page was built for publication: The \(k\)-size edge metric dimension of graphs