On trees with domination number equal to edge-vertex roman domination number
Keyword(s):
An edge-vertex Roman dominating function (or just ev-RDF) of a graph [Formula: see text] is a function [Formula: see text] such that for each vertex [Formula: see text] either [Formula: see text] where [Formula: see text] is incident with [Formula: see text] or there exists an edge [Formula: see text] adjacent to [Formula: see text] such that [Formula: see text]. The weight of a ev-RDF is the sum of its function values over all edges. The edge-vertex Roman domination number of a graph [Formula: see text], denoted by [Formula: see text], is the minimum weight of an ev-RDF [Formula: see text]. We provide a characterization of all trees with [Formula: see text], where [Formula: see text] is the domination number of [Formula: see text]
2020 ◽
Vol 12
(02)
◽
pp. 2050020
2018 ◽
Vol 11
(03)
◽
pp. 1850034
◽
2015 ◽
Vol 07
(04)
◽
pp. 1550048
◽
2018 ◽
Vol 12
(1)
◽
pp. 143-152
◽