Some progress on the restrained Roman domination
type: Item
instance of: scholarly article
title: Some progress on the restrained Roman domination
zbMATH Open document ID: 1467.05198
author: F. Siahpour
author: H. Abdollahzadeh Ahangar
author: Seyed Mahmood Sheikholeslami
published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series
publication date: 2021-04-27T00:00:00Z
review text: Let \(G = (V, E)\) be a graph. A Roman dominating function \(f = (V_0, V_1, V_2)\) is called restrained Roman dominating function (for short, RRDF) if the induced subgraph \(G[V_0]\) has no isolated vertex. The restrained Roman domination number of \(G\), denoted by \(\gamma_{rR}(G)\), is the minimum weight of an RRDF on \(G\). A \(\gamma_{rR}(G)\)-function \(f\) is an RRDF of \(G\) with \(w( f ) = \gamma_{rR}(G)\). In this paper, the authors study the graph \(G\) with \(\gamma_{rR}(G)=3\) and \(\gamma_{rR}(G)=n-1\) where \(n\) is the order of \(G\). One of the main results is: Theorem. Let \(\overline{G}\) be the complement of \(G\). For any connected graph \(G\) of order \(n \ge 5\), \[6\le \gamma_{rR}(G)+ \gamma_{rR}(\overline{G})\le n+5.\] The upper bound holds with equality if and only if \(G = C_5\) and the lower bound holds with equality if and only if \(G\) satisfies one of the following conditions: \begin{itemize} \item[(i)] \(\Delta(G) = n-1\), \(G\) has exactly one leaf and \(G\) has no vertex of degree \(n-2\). \item[(ii)] \(\Delta(G) = n-1\), \(\delta(G) = 2\) and \(G\) has a vertex \(u\) of degree \(2\) such that the induced subgraph \(G[V(G)-N[u]]\) has no universal vertex. \end{itemize}
reviewed by: Doost Ali Mojdeh
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 7340036
zbMATH Keywords: Roman domination number
zbMATH Keywords: restrained Roman domination number
zbMATH Keywords: Nordhaus-Gaddum inequalities
MaRDI profile type: Publication
full work available at URL: s40840-020-00965-0
OpenAlex ID: W3045088542
cites work: Q5206338
cites work: On the double Roman domination in graphs
cites work: Outer independent double Roman domination
cites work: Mixed Roman domination in graphs
cites work: Signed total double Roman k-domination in graphs
cites work: Bounds on the restrained Roman domination number of a graph
cites work: Roman Domination in Graphs
cites work: Some results on roman domination edge critical graphs
cites work: The Roman domatic problem in graphs and digraphs: a survey
cites work: Q4995292
cites work: Roman domination in graphs.
cites work: Restrained domination in trees
cites work: Restrained domination in graphs with minimum degree two
cites work: Restrained domination in graphs
cites work: Q4368728
cites work: Q4368729
cites work: On Complementary Graphs
cites work: Q5134323
cites work: Domination stability in graphs
cites work: Defendens Imperium Romanum: A Classical Problem in Military Strategy
cites work: Coupon coloring of some special graphs
cites work: Double Roman domination and domatic numbers of graphs
cites work: On the double Roman domination of graphs
DOI: 10.1007/S40840-020-00965-0
description: scientific article; zbMATH DE number 7340036