Roman {2}-domination in Graphs and Graph Products
From MaRDI portal
Publication:6187741
Abstract: For a graph of order , a Roman -dominating function has the property that for every vertex with , either is adjacent to a vertex assigned under , or is adjacent to least two vertices assigned under . In this paper, we classify all graphs with Roman -domination number belonging to the set . Furthermore, we obtain some results about Roman -domination number of some graph operations.
Recommendations
Cites work
- scientific article; zbMATH DE number 3902703 (Why is no real title available?)
- scientific article; zbMATH DE number 3914370 (Why is no real title available?)
- scientific article; zbMATH DE number 867701 (Why is no real title available?)
- Defending the Roman Empire---a new strategy
- Roman \(\{2 \}\)-domination
- Roman domination in graphs.
- Spectra of graphs
- The domination number of grids
- The domination numbers of the 5 × n and 6 × n grid graphs
This page was built for publication: Roman {2}-domination in Graphs and Graph Products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6187741)