Perfect double Italian domination of a graph
From MaRDI portal
Publication:6152610
DOI10.1080/09728600.2023.2218457MaRDI QIDQ6152610FDOQ6152610
Authors: Guoliang Hao, Parvin Jalilolghadr, Doost Ali Mojdeh
Publication date: 12 March 2024
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Roman domination in graphs.
- Roman \(\{2 \}\)-domination
- Double Roman domination
- Italian domination in trees
- Perfect Roman domination in trees
- Perfect Italian domination in trees
- On perfect Roman domination number in trees: complexity and bounds
- On the double Roman domination in graphs
- A Taxonomy of Perfect Domination
- Perfect double Roman domination of trees
- Total double Roman domination in graphs
- On the independent double Roman domination in graphs
- Bounds on the outer-independent double Italian domination number
- Roman \(\{ 3 \}\)-domination (double Italian domination)
- Perfect Italian domination in cographs
This page was built for publication: Perfect double Italian domination of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6152610)