Hardness results of connected power domination for bipartite graphs and chordal graphs (Q2150586)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness results of connected power domination for bipartite graphs and chordal graphs |
scientific article |
Statements
Hardness results of connected power domination for bipartite graphs and chordal graphs (English)
0 references
29 June 2022
0 references
connected power domination
0 references
\textsf{NP}-complete
0 references
graph algorithm
0 references
0 references
