On the super domination number of lexicographic product graphs (Q2420416): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3270978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super dominating sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2804821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Associative graph products and their independence, domination and coloring numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the roman domination in the lexicographic product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow domination in the lexicographic product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5790850 / rank
 
Normal rank

Latest revision as of 11:54, 19 July 2024

scientific article
Language Label Description Also known as
English
On the super domination number of lexicographic product graphs
scientific article

    Statements

    On the super domination number of lexicographic product graphs (English)
    0 references
    0 references
    0 references
    0 references
    6 June 2019
    0 references
    domination number
    0 references
    super domination number
    0 references
    domination in graphs
    0 references
    lexicographic product
    0 references
    NP-hardness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references