Roman {2}-domination in Graphs and Graph Products

DOI10.61186/IJMSI.18.2.117arXiv1701.01416MaRDI QIDQ6187741FDOQ6187741

Authors:

Publication date: 15 January 2024

Published in: Iranian Journal of Mathematical Sciences and Informatics (Search for Journal in Brave)

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,n-2,n-1,n$. Furthermore, we obtain some results about Roman $2$-domination number of some graph operations.

Full work available at URL: https://arxiv.org/abs/1701.01416

Recommendations

• The Roman \(\{2 \}\)-domatic number of graphs
• On the Roman \(\{2\}\)-domatic number of graphs
• Roman domination in graphs.
• Roman \(\{2 \}\)-domination
• On the roman domination in the lexicographic product of graphs

zbMATH Keywords

Cartesian productgrid graphRoman \(\{2\}\)-domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Spectra of graphs
• Roman domination in graphs.
• Defending the Roman Empire---a new strategy
• Roman \(\{2 \}\)-domination
• Title not available (Why is that?)
• Title not available (Why is that?)
• The domination number of grids
• The domination numbers of the 5 × n and 6 × n grid graphs
• Title not available (Why is that?)

Cited In (1)

• On Roman \(\{2\}\)-domination number of \(k\)th power of paths and cycles

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)