Extended chain of domination parameters in graphs (Q2449267)

From MaRDI portal
Revision as of 17:26, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Extended chain of domination parameters in graphs
scientific article

    Statements

    Extended chain of domination parameters in graphs (English)
    0 references
    0 references
    0 references
    7 May 2014
    0 references
    Summary: A subset \(S\) of the vertex set \(V(G)\) of a graph \(G\) is called an isolate set if the subgraph induced by \(S\) has an isolated vertex. The subset \(S\) is called an isolate dominating set if it is both isolate and dominating. Also, \(S\) is called an isolate irredundant set if it is both isolate and irredundant. In this paper, we establish a chain connecting various isolate parameters with the existing domination parameters and discuss equality among the parameters in the extended chain.
    0 references
    isolate set
    0 references
    isolate irredundant set
    0 references
    isolate dominating set
    0 references

    Identifiers