Roman {2}-domination in Graphs and Graph Products

From MaRDI portal
Publication:6187741




Abstract: For a graph G=(V,E) of order n, a Roman 2-dominating function f:Vightarrow0,1,2 has the property that for every vertex vinV with f(v)=0, either v is adjacent to a vertex assigned 2 under f, or v is adjacent to least two vertices assigned 1 under f. In this paper, we classify all graphs with Roman 2-domination number belonging to the set 2,3,4,n2,n1,n. Furthermore, we obtain some results about Roman 2-domination number of some graph operations.









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)