Graphs having distance-\(n\) domination number half their order (Q1613368)

From MaRDI portal
Revision as of 15:22, 4 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Graphs having distance-\(n\) domination number half their order
scientific article

    Statements

    Graphs having distance-\(n\) domination number half their order (English)
    0 references
    0 references
    0 references
    29 August 2002
    0 references
    A set \(D\) of vertices in a graph \(G\) is distance-\(n\) dominating if, for every vertex \(v\in V(G)- D\), there is a vertex \(d\in D\) such that \(\text{dist}(v, d)= n\). The authors give a characterization of graphs \(G\) of diameter at least \(2n-1\) that have a minimum distance-\(n\) dominating set of cardinality \(p/2\), where \(p\) is the order of \(G\). This confirms a conjecture by James W. Boland, Teresa W. Haynes and Linda M. Lawson.
    0 references
    0 references
    dominating sets
    0 references
    diameter
    0 references
    distance-\(n\) domination
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers