Note on the perfect Roman domination number of graphs
From MaRDI portal
Publication:2284084
DOI10.1016/j.amc.2019.124685zbMath1433.05256OpenAlexW2970666029WikidataQ127322354 ScholiaQ127322354MaRDI QIDQ2284084
Publication date: 14 January 2020
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2019.124685
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (6)
Perfect Roman domination in middle graphs ⋮ On the perfect differential of a graph ⋮ Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs ⋮ Perfect Italian domination in cographs ⋮ Total Roman domination on the digraphs ⋮ Toughness, forbidden subgraphs and pancyclicity
Cites Work
- Unnamed Item
- Coupon coloring of some special graphs
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs
- Roman domination in graphs.
- Perfect Roman domination in trees
- Note on the perfect EIC-graphs
- Network entropies based on independent sets and matchings
- Nordhaus-Gaddum type results for graph irregularities
- Integer linear programming models for the weighted total domination problem
- On perfect Roman domination number in trees: complexity and bounds
- Total Roman domination in the lexicographic product of graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- A Linear Recognition Algorithm for Cographs
This page was built for publication: Note on the perfect Roman domination number of graphs