Perfect Roman domination in regular graphs
From MaRDI portal
Publication:5155702
DOI10.2298/AADM1801143HzbMATH Open1488.05379OpenAlexW2802979285WikidataQ129963383 ScholiaQ129963383MaRDI QIDQ5155702FDOQ5155702
Authors: Michael A. Henning, William F. Klostermeyer 
Publication date: 8 October 2021
Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/aadm1801143h
Recommendations
Cites Work
- Title not available (Why is that?)
- Roman domination in graphs.
- Extremal problems for roman domination
- A new lower bound on the independence number of a graph and applications
- Total domination in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Title not available (Why is that?)
- Independence, clique size and maximum degree
- Signed domination in regular graphs
- Double Roman domination
- Perfect Roman domination in trees
- Roman domination perfect graphs
- A Taxonomy of Perfect Domination
Cited In (7)
- Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs
- Perfect Italian domination on planar and regular graphs
- Perfect Roman domination in graphs
- Varieties of Roman Domination
- A characterization of perfect Roman trees
- On the perfect differential of a graph
- Roman domination and independent Roman domination on graphs with maximum degree three
This page was built for publication: Perfect Roman domination in regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5155702)
