The fault‐tolerant beacon set of hexagonal Möbius ladder network

DOI10.1002/mma.9091OpenAlexW4319320657MaRDI QIDQ6184060

Muhammad Azeem, Muhammad Faisal Nadeem

Publication date: 5 January 2024

Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/mma.9091

zbMATH Keywords

fault-tolerant metric dimensionfault-tolerant resolving setfault-tolerant beacon sethexagonal Möbius ladder network

Mathematics Subject Classification ID

Applications of graph theory (05C90) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• 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
• Edge version of metric dimension and doubly resolving sets of the necklace graph
• On the fault-tolerant metric dimension of convex polytopes
• The locating number of hexagonal Möbius ladder network
• Metric dimension, minimal doubly resolving sets, and the strong metric dimension for jellyfish graph and cocktail party graph
• Fault-tolerant metric dimension of circulant graphs \(C_n(1,2,3)\)
• On the fault-tolerant metric dimension of certain interconnection networks
• Landmarks in graphs
• Minimum Fault-Tolerant, local and strong metric dimension of graphs
• On the Metric Dimension of Cartesian Products of Graphs
• The independent resolving number of a graph
• A Combinatory Detection Problem