Identifying and locating-dominating codes on chains and cycles (Q1883609)

From MaRDI portal
Revision as of 07:49, 16 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Identifying and locating-dominating codes on chains and cycles
scientific article

    Statements

    Identifying and locating-dominating codes on chains and cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 October 2004
    0 references
    On a connected undirected graph \((V,E)\), an \(r\)-identifying code is a subset \(C\) of \(V\) such that the sets \(B_r(v)\cap C\) are distinct and nonempty for all \(v\in V\). A code is \(r\)-locating-dominating if this is true for all \(v\in V\backslash C\). This paper determines the minimum sizes (or densities) in many cases for these codes on finite and infinite chains and cycles.
    0 references
    \(r\)-identifying code
    0 references
    \(r\)-locating-dominating code
    0 references
    0 references

    Identifiers