Perfect Roman domination in middle graphs

DOI10.47443/DML.2021.0066MaRDI QIDQ5051448zbMATH OpenOpenAlexFDO

Authors Kijung Kim

Publication date 23 November 2022

Published in Discrete Mathematics Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2106.01539

zbMATH Keywords

middle graphperfect dominationperfect Roman dominationRoman domination

Mathematics Subject Classification ID

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

Recommendations

• Characterization of perfect Roman domination edge critical trees
• Perfect Roman domination in graphs
• A characterization of perfect Roman trees
• Perfect Roman domination in trees
• Roman domination perfect graphs

Cites work

• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Graph theory
• Middle domination and 2-independence in trees
• Note on the perfect Roman domination number of graphs
• On perfect Roman domination number in trees: complexity and bounds
• Perfect Roman domination in trees
• Roman domination in graphs.
• Total domination number of middle graphs
• Traversability and connectivity of the middle graph of a graph

Cited in

(3)

• Italian, 2-rainbow and Roman domination numbers in middle graphs
• Domination-related parameters in middle graphs
• The perfect locating signed Roman domination of some graphs

This page was built for publication: Perfect Roman domination in middle graphs

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