An algorithm to recognize weak Roman domination stable trees under vertex deletion

DOI10.1142/S1793830920500494MaRDI QIDQ5858156zbMATH OpenOpenAlexFDO

Authors B. Mahavir, M. Kamalam, P. Roushini Leely Pushpam

Publication date 9 April 2021

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830920500494

zbMATH Keywords

weak Roman domination number

Mathematics Subject Classification ID

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

Recommendations

• Weak Roman domination in graphs
• Effect of vertex deletion on the weak Roman domination number of a graph
• Graphs whose weak Roman domination number increases by the deletion of any edge
• Trees T with weak Roman domination number being equal to domination number
• scientific article; zbMATH DE number 6129508

Cites work

• Defending the Roman Empire---a new strategy
• Edge roman domination in graphs
• Effect of vertex deletion on the weak Roman domination number of a graph
• Exact algorithms for weak Roman domination
• Global Roman domination in graphs
• Introduction to algorithms.
• On efficiently Roman dominatable graphs
• Roman domination in graphs.
• Weak Roman domination in graphs

Cited in

(2)

• Effect of vertex deletion on the weak Roman domination number of a graph
• Weak Roman subdivision number of graphs

This page was built for publication: An algorithm to recognize weak Roman domination stable trees under vertex deletion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5858156)