The locating number of hexagonal Möbius ladder network
From MaRDI portal
Publication:2053208
DOI10.1007/s12190-020-01430-8zbMath1475.05056OpenAlexW3081836643MaRDI QIDQ2053208
Muhammad Faisal Nadeem, Adnan Khalil, Muhammad Azeem
Publication date: 29 November 2021
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-020-01430-8
Related Items
On adjacency metric dimension of some families of graph ⋮ Partition dimension of COVID antiviral drug structures ⋮ The fault‐tolerant beacon set of hexagonal Möbius ladder network ⋮ The vertex-edge resolvability of some wheel-related graphs ⋮ Computation of edge resolvability of benzenoid tripod structure
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the metric dimension of wheel related graphs
- Approximation complexity of metric dimension problem
- On minimum metric dimension of honeycomb networks
- Resolvability in graphs and the metric dimension of a graph
- Landmarks in graphs
- The independent resolving number of a graph
- On Metric Generators of Graphs
- A Combinatory Detection Problem