Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs (Q2008916): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:32, 5 March 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
