外独立总双意大利支配数

IF 0.2 Q4 COMPUTER SCIENCE, THEORY & METHODS
S. M. Sheikholeslami, L. Volkmann
{"title":"外独立总双意大利支配数","authors":"S. M. Sheikholeslami, L. Volkmann","doi":"10.56415/csjm.v32.02","DOIUrl":null,"url":null,"abstract":"If $G$ is a graph with vertex set $V(G)$, then let $N[u]$ be the closed neighborhood of the vertex $u\\in V(G)$. A total double Italian dominating function (TDIDF) on a graph $G$ is a function $f:V(G)\\rightarrow\\{0,1,2,3\\}$ satisfying (i) $f(N[u])\\ge 3$ for every vertex $u\\in V(G)$ with $f(u)\\in\\{0,1\\}$ and (ii) the subgraph induced by the vertices with a non-zero label has no isolated vertices. A TDIDF is an outer-independent total double Italian dominating function (OITDIDF) on $G$ if the set of vertices labeled $0$ induces an edgeless subgraph. The weight of an OITDIDF is the sum of its function values over all vertices, and the outer independent total double Italian domination number $\\gamma_{tdI}^{oi}(G)$ is the minimum weight of an OITDIDF on $G$. In this paper, we establish various bounds on $\\gamma_{tdI}^{oi}(G)$, and we determine this parameter for some special classes of graphs.","PeriodicalId":42293,"journal":{"name":"Computer Science Journal of Moldova","volume":null,"pages":null},"PeriodicalIF":0.2000,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Outer independent total double Italian domination number\",\"authors\":\"S. M. Sheikholeslami, L. Volkmann\",\"doi\":\"10.56415/csjm.v32.02\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"If $G$ is a graph with vertex set $V(G)$, then let $N[u]$ be the closed neighborhood of the vertex $u\\\\in V(G)$. A total double Italian dominating function (TDIDF) on a graph $G$ is a function $f:V(G)\\\\rightarrow\\\\{0,1,2,3\\\\}$ satisfying (i) $f(N[u])\\\\ge 3$ for every vertex $u\\\\in V(G)$ with $f(u)\\\\in\\\\{0,1\\\\}$ and (ii) the subgraph induced by the vertices with a non-zero label has no isolated vertices. A TDIDF is an outer-independent total double Italian dominating function (OITDIDF) on $G$ if the set of vertices labeled $0$ induces an edgeless subgraph. The weight of an OITDIDF is the sum of its function values over all vertices, and the outer independent total double Italian domination number $\\\\gamma_{tdI}^{oi}(G)$ is the minimum weight of an OITDIDF on $G$. In this paper, we establish various bounds on $\\\\gamma_{tdI}^{oi}(G)$, and we determine this parameter for some special classes of graphs.\",\"PeriodicalId\":42293,\"journal\":{\"name\":\"Computer Science Journal of Moldova\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.2000,\"publicationDate\":\"2024-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Science Journal of Moldova\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.56415/csjm.v32.02\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Science Journal of Moldova","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.56415/csjm.v32.02","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

如果 $G$ 是一个具有顶点集 $V(G)$ 的图,那么设 $N[u]$ 是 V(G)$ 中顶点 $u\ 的封闭邻域。图 $G$ 上的总双意占优函数(TDIDF)是一个函数 $f:V(G)\rightarrow\{0,1,2,3\}$,它满足:(i) $f(N[u])\ge 3$ 对于 V(G)$ 中的每个顶点 $u,且 $f(u)\in\{0,1\}$;(ii) 由具有非零标签的顶点所诱导的子图中没有孤立顶点。如果标有 $0$ 的顶点集诱导了一个无边子图,那么 TDIDF 就是 $G$ 上的一个外部独立全双意占优函数(OITDIDF)。OITDIDF 的权重是其在所有顶点上的函数值之和,而外部独立全双意支配数 $\gamma_{tdI}^{oi}(G)$ 是 OITDIDF 在 $G$ 上的最小权重。在本文中,我们建立了 $\gamma_{tdI}^{oi}(G)$ 的各种界限,并确定了一些特殊图类的这一参数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Outer independent total double Italian domination number
If $G$ is a graph with vertex set $V(G)$, then let $N[u]$ be the closed neighborhood of the vertex $u\in V(G)$. A total double Italian dominating function (TDIDF) on a graph $G$ is a function $f:V(G)\rightarrow\{0,1,2,3\}$ satisfying (i) $f(N[u])\ge 3$ for every vertex $u\in V(G)$ with $f(u)\in\{0,1\}$ and (ii) the subgraph induced by the vertices with a non-zero label has no isolated vertices. A TDIDF is an outer-independent total double Italian dominating function (OITDIDF) on $G$ if the set of vertices labeled $0$ induces an edgeless subgraph. The weight of an OITDIDF is the sum of its function values over all vertices, and the outer independent total double Italian domination number $\gamma_{tdI}^{oi}(G)$ is the minimum weight of an OITDIDF on $G$. In this paper, we establish various bounds on $\gamma_{tdI}^{oi}(G)$, and we determine this parameter for some special classes of graphs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Science Journal of Moldova
Computer Science Journal of Moldova COMPUTER SCIENCE, THEORY & METHODS-
CiteScore
0.80
自引率
0.00%
发文量
0
审稿时长
16 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信