Fault-tolerant resolvability in some classes of line graphs (Q2004093): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 17:54, 1 February 2024

scientific article
Language Label Description Also known as
English
Fault-tolerant resolvability in some classes of line graphs
scientific article

    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