Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs (Q2008916): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q128507752, #quickstatements; #temporary_batch_1726262144271
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Some bounds on the \(p\)-domination number in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 2-rainbow domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow domination on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-domination and \(k\)-independence in graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the super domination number of lexicographic product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the conjecture regarding the sum of domination number and average eccentricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further results regarding the sum of domination number and average eccentricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of the domination number and the independent domination number in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in graphs: A survey and recent results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / 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: On \(k\)-rainbow independent domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of the \(k\)-domination problem in graphs / 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: Q5442510 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128507752 / rank
 
Normal rank

Latest revision as of 22:18, 13 September 2024

scientific article
Language Label Description Also known as
English
Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs
scientific article

    Statements

    Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs (English)
    0 references
    0 references
    26 November 2019
    0 references
    complexity
    0 references
    algorithm
    0 references
    NP-completeness
    0 references
    domination
    0 references
    lexicographic product
    0 references

    Identifiers