Affiliation:
1. Department of Mathematics and Statistics, College of Science, King Faisal University, P. O. Box 400, Al-Ahsa, 31982, Saudi Arabia
2. Department of Mathematics, College of Science, Federal University of Agriculture, Makurdi, Nigeria
Abstract
<abstract><p>A vertex-edge perfect Roman dominating function on a graph $ G = (V, E) $ (denoted by ve-PRDF) is a function $ f:V\left(G\right)\longrightarrow\{0, 1, 2\} $ such that for every edge $ uv\in E $, $ \max\{f(u), f(v)\}\neq0 $, or $ u $ is adjacent to exactly one neighbor $ w $ such that $ f(w) = 2 $, or $ v $ is adjacent to exactly one neighbor $ w $ such that $ f(w) = 2 $. The weight of a ve-PRDF on $ G $ is the sum $ w(f) = \sum_{v\in V}f(v) $. The vertex-edge perfect Roman domination number of $ G $ (denoted by $ \gamma_{veR}^{p}(G) $) is the minimum weight of a ve-PRDF on $ G $. In this paper, we first show that vertex-edge perfect Roman dominating is NP-complete for bipartite graphs. Also, for a tree $ T $, we give upper and lower bounds for $ \gamma_{veR}^{p}(T) $ in terms of the order $ n $, $ l $ leaves and $ s $ support vertices. Lastly, we determine $ \gamma_{veR}^{p}(G) $ for Petersen, cycle and Flower snark graphs.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Reference13 articles.
1. A. Almulhim, A. Akwu, B. Al Subaiei, The perfect roman domination number of the cartesian product of some graphs, J. Math., 2022 (2022), 1957027. http://dx.doi.org/10.1155/2022/1957027
2. G. Chang, S. Chen, C. Liu, Edge Roman domination on graphs, Graph. Combinator., 32 (2016), 1731–1747. http://dx.doi.org/10.1007/s00373-016-1695-x
3. E. Cockayne, P. Dreyer, S. Hedetniemi, S. Hedetniemi, Roman domination in graphs, Discrete Math., 278 (2004), 11–22. http://dx.doi.org/10.1016/j.disc.2003.06.004
4. I. Dejter, Perfect domination in regular grid graphs, Australas. J. Comb., 42 (2008), 99–114.
5. T. Haynes, S. Hedetniemi, P. Slater, Fundamentals of domination in graphs, Boca Raton: CRC Press, 1998. http://dx.doi.org/10.1201/9781482246582
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献