Computing strong Roman domination of trees and unicyclic graphs in linear time

DOI10.1007/s40840-022-01301-4zbMath1498.05212OpenAlexW4281254871MaRDI QIDQ2082401

Noor A'lawiah Abd Aziz, Abolfazl Poureidi, Hailiza Kamarulhaili, Nader Jafari Rad

Publication date: 4 October 2022

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-022-01301-4

zbMATH Keywords

treealgorithmunicyclic graphsstrong Roman dominating function

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Rainbow domination in graphs
• Roman domination in graphs.
• On the strong Roman domination number of graphs
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Varieties of Roman Domination
• Roman Domination in Graphs
• Varieties of Roman domination II

This page was built for publication: Computing strong Roman domination of trees and unicyclic graphs in linear time