On roman domination number of functigraph and its complement
Let $$G = (V(G),E(G))$$ be a graph and $$f:V(G) \to \{ 0,1,2\} $$ be a function where for every vertex $$v \in V(G)$$ with $$f(v) = 0,$$ there is a vertex $$u \in {N_G}(v),$$ where $$f(u) = 2.$$ Then $$f$$ is a Roman dominating function or a $$RDF$$ of $$G.$$ The weight of $$f$$ is $$f(V(G)) = \sum\...
Main Authors: | Ebrahim Vatandoost, Athena Shaminezhad |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2020-01-01
|
Series: | Cogent Mathematics & Statistics |
Subjects: | |
Online Access: | http://dx.doi.org/10.1080/25742558.2020.1858560 |
Similar Items
-
On 2-rainbow domination number of functigraph and its complement
by: Athena Shaminezhad, et al.
Published: (2020-10-01) -
On the Distinguishing Number of Functigraphs
by: Muhammad Fazil, et al.
Published: (2018-08-01) -
The Distance Roman Domination Numbers of Graphs
by: Aram Hamideh, et al.
Published: (2013-09-01) -
A note on the bounds of Roman domination numbers
by: Zepeng Li
Published: (2021-02-01) -
Bounds on the restrained Roman domination number of a graph
by: H. Abdollahzadeh Ahangar, et al.
Published: (2016-01-01)