Note on the perfect Roman domination number of graphs
From MaRDI portal
(Redirected from Publication:2284084)
Recommendations
Cites work
- A Linear Recognition Algorithm for Cographs
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs
- Coupon coloring of some special graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Graph theory
- Integer linear programming models for the weighted total domination problem
- Network entropies based on independent sets and matchings
- Nordhaus-Gaddum type results for graph irregularities
- Note on the perfect EIC-graphs
- On perfect Roman domination number in trees: complexity and bounds
- Perfect Roman domination in trees
- Roman domination in graphs.
- Total Roman domination in the lexicographic product of graphs
Cited in
(10)- Toughness, forbidden subgraphs and pancyclicity
- Perfect Italian domination in cographs
- 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
- Total Roman domination on the digraphs
- The perfect locating signed Roman domination of some graphs
- On the perfect differential and perfect Roman domination in complementary prisms
- On perfect Italian domination in graphs
- Roman domination parameters with respect to differentials in probabilistic neural networks
This page was built for publication: Note on the perfect Roman domination number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2284084)