On the 2-metric resolvability of graphs
From MaRDI portal
Publication:2132227
DOI10.3934/MATH.2020425zbMATH Open1485.05138OpenAlexW3080900797MaRDI QIDQ2132227FDOQ2132227
Authors: Chenggang Huo, Humera Bashir, Zohaib Zahid, Yu-Ming Chu 
Publication date: 27 April 2022
Published in: AIMS Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/math.2020425
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fault-tolerant metric dimension of graphs
- Landmarks in graphs
- The \(k\)-metric dimension of the lexicographic product of graphs
- \(k\)-metric resolvability in graphs
- Families of regular graphs with constant metric dimension
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the metric dimension of Möbius ladders.
- The \(k\)-metric dimension of corona product graphs
- Computing the \(k\)-metric dimension of graphs
- Relationships between the 2-metric dimension and the 2-adjacency dimension in the lexicographic product of graphs
- Fault-tolerant locating-dominating sets
- The metric dimension of circulant graphs and Cayley hypergraphs
- Fault-tolerance in resolvability
- On the fault-tolerant metric dimension of convex polytopes
- Minimum Fault-Tolerant, local and strong metric dimension of graphs
- Stacked book graphs are cycle-antimagic
- Irregularity measures for metal-organic networks
Uses Software
This page was built for publication: On the 2-metric resolvability of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2132227)
