Fault-tolerant resolvability in some classes of line graphs

DOI10.1155/2020/1436872zbMath1459.05279OpenAlexW3088581970MaRDI QIDQ2004093

Xuan Guo, Waqas Nazeer, Jingjng Li, Zohaib Zahid, Muhammad Faheem

Publication date: 14 October 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Fault-tolerant metric dimension of zero-divisor graphs of commutative rings ⋮ Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks ⋮ Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension ⋮ Computing vertex resolvability of some regular planar graphs ⋮ Fault-tolerant resolvability of some graphs of convex polytopes ⋮ Distance measurements related to Cartesian product of cycles

Cites Work

• 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
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item