Signed Roman domination in digraphs

被引:0
作者
S. M. Sheikholeslami
L. Volkmann
机构
[1] Azarbaijan Shahid Madani University,Department of Mathematics
[2] RWTH Aachen University,Lehrstuhl II für Mathematik
来源
Journal of Combinatorial Optimization | 2015年 / 30卷
关键词
Digraph; Signed Roman dominating function; Signed Roman domination number; 05C20; 05C69;
D O I
暂无
中图分类号
学科分类号
摘要
Let D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$D$$\end{document} be a finite and simple digraph with vertex set V(D)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$V(D)$$\end{document} and arc set A(D)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A(D)$$\end{document}. A signed Roman dominating function (SRDF) on the digraph D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$D$$\end{document} is a function f:V(D)→{-1,1,2}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f:V(D)\rightarrow \{-1,1,2\}$$\end{document} satisfying the conditions that (i) ∑x∈N-[v]f(x)≥1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sum _{x\in N^-[v]}f(x)\ge 1$$\end{document} for each v∈V(D)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$v\in V(D)$$\end{document}, where N-[v]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N^-[v]$$\end{document} consists of v\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$v$$\end{document} and all in-neighbors of v\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$v$$\end{document}, and (ii) every vertex u\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$u$$\end{document} for which f(u)=-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f(u)=-1$$\end{document} has an in-neighbor v\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$v$$\end{document} for which f(v)=2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f(v)=2$$\end{document}. The weight of an SRDF f\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f$$\end{document} is w(f)=∑v∈V(D)f(v)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$w(f)=\sum _{v\in V(D)}f(v)$$\end{document}. The signed Roman domination number γsR(D)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _{sR}(D)$$\end{document} of D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$D$$\end{document} is the minimum weight of an SRDF on D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$D$$\end{document}. In this paper we initiate the study of the signed Roman domination number of digraphs, and we present different bounds on γsR(D)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _{sR}(D)$$\end{document}. In addition, we determine the signed Roman domination number of some classes of digraphs. Some of our results are extensions of well-known properties of the signed Roman domination number γsR(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _{sR}(G)$$\end{document} of graphs G\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G$$\end{document}.
引用
收藏
页码:456 / 467
页数:11
相关论文
共 50 条
[41]   Roman domination in oriented trees [J].
Ouldrabah, Lyes ;
Blidia, Mostafa ;
Bouchou, Ahmed .
ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2021, 9 (01) :95-103
[42]   On signed domination number of Cartesian product of directed paths [J].
Wang, Haichao ;
Kim, Hye Kyung ;
Deng, Yunping .
UTILITAS MATHEMATICA, 2018, 109 :45-61
[43]   TWIN ROMAN DOMINATION NUMBER OF A DIGRAPH [J].
Ahangar, H. Abdollahzadeh ;
Amjadi, J. ;
Sheikholeslami, S. M. ;
Samodivkin, V. ;
Volkmann, L. .
MISKOLC MATHEMATICAL NOTES, 2016, 17 (01) :3-14
[44]   The kth upper bases of primitive non-powerful signed digraphs [J].
Shao, Yanling ;
Shen, Jian ;
Gao, Yubin .
DISCRETE MATHEMATICS, 2009, 309 (09) :2682-2686
[45]   The signed total Roman domatic number of a digraph [J].
Amjadi, J. .
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2018, 10 (02)
[46]   Private Out-Domination Number of Generalized de Bruijn Digraphs [J].
Marimuthu, G. ;
Johnson, B. .
APPLICATIONS AND APPLIED MATHEMATICS-AN INTERNATIONAL JOURNAL, 2014, 9 (02) :504-517
[47]   The kth upper and lower bases of primitive nonpowerful minimally strong signed digraphs [J].
Shao, Yanling ;
Shen, Jian ;
Gao, Yubin .
LINEAR & MULTILINEAR ALGEBRA, 2012, 60 (09) :1093-1113
[48]   Double vertex digraphs of digraphs [J].
Gao, Yubin ;
Shao, Yanling .
DISCRETE MATHEMATICS, 2009, 309 (08) :2432-2444
[49]   Cospectral digraphs from locally line digraphs [J].
Dalfo, C. ;
Fiol, M. A. .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2016, 500 :52-62
[50]   From Subkautz Digraphs to Cyclic Kautz Digraphs [J].
Dalfo, C. .
JOURNAL OF INTERCONNECTION NETWORKS, 2018, 18 (2-3) :2-3