Fault-tolerant resolvability in some classes of line graphs (Q2004093)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7260832
Language Label Description Also known as
default for all languages
No label defined
    English
    Fault-tolerant resolvability in some classes of line graphs
    scientific article; zbMATH DE number 7260832

      Statements

      Fault-tolerant resolvability in some classes of line graphs (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      14 October 2020
      0 references
      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.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references