Fault-tolerant resolvability in some classes of line graphs

DOI10.1155/2020/1436872MaRDI QIDQ2004093zbMATH OpenOpenAlexFDO

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

Publication date 14 October 2020

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

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

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

Review text

Summary: Fault tolerance is the characteristic of a system that permits it to carry on its intended operations in case of the failure of one of its units. Such a system is known as the fault-tolerant self-stable system. In graph theory, if we remove any vertex in a resolving set, then the resulting set is also a resolving set, called the fault-tolerant resolving set, and its minimum cardinality is called the fault-tolerant metric dimension. In this paper, we determine the fault-tolerant resolvability in line graphs. As a main result, we computed the fault-tolerant metric dimension of line graphs of necklace and prism graphs.

Recommendations

• Fault-tolerant metric dimension of graphs
• Fault-tolerance in resolvability
• Fault-tolerant metric dimension of P(n, 2)ʘK₁ graph
• Fault-tolerant strong metric dimension of graphs
• FAULT-TOLERANT METRIC DIMENSION OF CIRCULANT GRAPHS

Cites work

• Counterexamples for properties of line graphs of graphs of diameter two
• Edge metric dimension of graphs.
• Edge version of metric dimension and doubly resolving sets of the necklace graph
• Fault-tolerance in resolvability
• Fault-tolerant metric dimension of circulant graphs \(C_n(1,2,3)\)
• Fault-tolerant metric dimension problem: a new integer linear programming formulation and exact formula for grid graphs
• scientific article; zbMATH DE number 4070954 (Why is no real title available?)
• scientific article; zbMATH DE number 3765830 (Why is no real title available?)
• scientific article; zbMATH DE number 3494441 (Why is no real title available?)
• scientific article; zbMATH DE number 3544092 (Why is no real title available?)
• scientific article; zbMATH DE number 2068163 (Why is no real title available?)
• scientific article; zbMATH DE number 3080144 (Why is no real title available?)
• Landmarks in graphs
• On the fault-tolerant metric dimension of certain interconnection networks
• On the fault-tolerant metric dimension of convex polytopes
• Resolvability in graphs and the metric dimension of a graph

Cited in

(9)

• Distance measurements related to Cartesian product of cycles
• Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks
• scientific article; zbMATH DE number 219243 (Why is no real title available?)
• Fault-tolerant metric dimension of zero-divisor graphs of commutative rings
• 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
• Investigating the Metric and Fault-Tolerant Dimensions in Para-Line Network Topologies
• Fault-tolerant resolvability of double antiprism and its related graphs

This page was built for publication: Fault-tolerant resolvability in some classes of line graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004093)