Abstract
Let be a graph and
be a function where for every vertex
with
there is a vertex
where
Then
is a Roman dominating function or a
of
The weight of
is
The minimum weight of all
is called the Roman domination number of
denoted by
Let
be a graph with
and G' be a copy of
with
Then a functigraph
with function
is denoted by
its vertices and edges are
and
respectively. This paper deals with the Roman domination number of the functigraph and its complement. We present a general bound
where
is a permutation. Also, the Roman domination number of some special graphs are considered. We obtain a general bound of
and we show that this bound is sharp.
PUBLIC INTEREST STATEMENT
Roman domination number is one of the interesting research areas in graph theory. The concept Roman dominating function was first defined by Cockayne, Dreyer, Hedetniemi and Hedetniemi and was motivated by an article in Scientific American by Ian Stewart entitled “Defend the Roman Empire”. The Roman domination number has been used in order to defending the Roman Empire that has the potential of saving the Emperor Constantine the Great substantial costs of maintaining legions, while still defending the Roman Empire.
Acknowledgements
The authors are very grateful to the referee for his/her useful comments.
Drear professor,
Thank you very much for your concerning. Here, i supply our biography and interest statements.
Additional information
Funding
Notes on contributors
Ebrahim Vatandoost
Ebrahim Vatandoost is presently working as an assistant professor in the Department of Mathematics, Imam Khomeini International University, Qazvin, Iran. His field of specialties includes Group Theory and Graph Theory
Athena Shaminejad is a PhD candidate of graph theory in the Department of Mathematics, Imam Khomeini International University, Qazvin, Iran. Her favorite fields are Graph Theory and Graph Theory.