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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5818996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolvability in graphs and the metric dimension of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4464781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fault-tolerant metric dimension of convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant metric dimension of circulant graphs \(C_n(1,2,3)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5011071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge version of metric dimension and doubly resolving sets of the necklace graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5412687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fault-tolerant metric dimension of certain interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Landmarks in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3382217 / rank
 
Normal rank

Latest revision as of 19:35, 23 July 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
    0 references