Computing strong Roman domination of trees and unicyclic graphs in linear time (Q2082401)
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: Computing strong Roman domination of trees and unicyclic graphs in linear time |
scientific article; zbMATH DE number 7596059
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing strong Roman domination of trees and unicyclic graphs in linear time |
scientific article; zbMATH DE number 7596059 |
Statements
Computing strong Roman domination of trees and unicyclic graphs in linear time (English)
0 references
4 October 2022
0 references
strong Roman dominating function
0 references
algorithm
0 references
tree
0 references
unicyclic graphs
0 references
