Order-sensitive domination in partially ordered sets and graphs (Q6105038)

From MaRDI portal
scientific article; zbMATH DE number 7701690
Language Label Description Also known as
English
Order-sensitive domination in partially ordered sets and graphs
scientific article; zbMATH DE number 7701690

    Statements

    Order-sensitive domination in partially ordered sets and graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 June 2023
    0 references
    In this paper, the authors study the order-sensitive domination number and the height three reduction of a poset and extend the order-sensitive domination to general graphs. Moreover, they show that the order-sensitive domination number of a poset exactly corresponds to the biclique vertex-partition number of the associated bipartite transformation of the poset.
    0 references
    domination
    0 references
    partially ordered set
    0 references
    order-sensitive
    0 references
    comparability
    0 references
    Roman domination
    0 references
    biclique vertex-partition
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references