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
来源
关键词
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] Signed total strong Roman domination in graphs
    Hajjari, Maryam
    Sheikholeslami, Seyed Mahmoud
    DISCRETE MATHEMATICS LETTERS, 2022, 10 : 41 - 44
  • [42] On the signed Roman k-domination in graphs
    Amjadi, J.
    Nazari-Moghaddam, S.
    Sheikholeslami, S. M.
    Volkmann, L.
    QUAESTIONES MATHEMATICAE, 2020, 43 (08) : 1065 - 1082
  • [43] Signed double Roman domination on cubic graphs
    Iurlano, Enrico
    Zec, Tatjana
    Djukanovic, Marko
    Raidl, Guenther R.
    APPLIED MATHEMATICS AND COMPUTATION, 2024, 471
  • [44] Signed mixed Roman domination numbers in graphs
    H. Abdollahzadeh Ahangar
    L. Asgharsharghi
    S. M. Sheikholeslami
    L. Volkmann
    Journal of Combinatorial Optimization, 2016, 32 : 299 - 317
  • [45] Signed mixed Roman domination numbers in graphs
    Ahangar, H. Abdollahzadeh
    Asgharsharghi, L.
    Sheikholeslami, S. M.
    Volkmann, L.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 32 (01) : 299 - 317
  • [46] Bounds on signed total double Roman domination
    Shahbazi, L.
    Ahangar, H. Abdollahzadeh
    Khoeilar, R.
    Sheikholeslami, S. M.
    COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2020, 5 (02) : 191 - 206
  • [47] Outer independent signed double Roman domination
    Abdollahzadeh Ahangar, H.
    Pour, F. Nahani
    Chellali, M.
    Sheikholeslami, S. M.
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2022, 68 (02) : 705 - 720
  • [48] Signed Roman edge domination numbers in graphs
    H. Abdollahzadeh Ahangar
    J. Amjadi
    S. M. Sheikholeslami
    L. Volkmann
    Y. Zhao
    Journal of Combinatorial Optimization, 2016, 31 : 333 - 346
  • [49] The signed Roman k-domatic number of digraphs
    Volkmann, Lutz
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2016, 64 : 444 - 457
  • [50] Twin signed total Roman domatic numbers in digraphs
    Amjadi, Jafar
    COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2021, 6 (01) : 17 - 26