Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs (Q2008916): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2018.12.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2911153821 / rank | |||
Normal rank | |||
Revision as of 00:21, 20 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
