Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs (Q2008916): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q128507752, #quickstatements; #temporary_batch_1726262144271 |
||
| 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
26 November 2019
0 references
complexity
0 references
algorithm
0 references
NP-completeness
0 references
domination
0 references
lexicographic product
0 references
0 references
