Algorithmic results for weak Roman domination problem in graphs (Q6633543)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithmic results for weak Roman domination problem in graphs |
scientific article; zbMATH DE number 7939393
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic results for weak Roman domination problem in graphs |
scientific article; zbMATH DE number 7939393 |
Statements
Algorithmic results for weak Roman domination problem in graphs (English)
0 references
6 November 2024
0 references
weak Roman dominating function
0 references
bipartite graphs
0 references
split graphs
0 references
\(P_4\)-sparse graphs
0 references
graph algorithms
0 references
NP-completeness
0 references
