On the Signed Domination Number of the Cartesian Product of Two Directed Cycles

Ramy S. Shaheen
{"title":"On the Signed Domination Number of the Cartesian Product of Two Directed Cycles","authors":"Ramy S. Shaheen","doi":"10.4236/OJDM.2015.53005","DOIUrl":null,"url":null,"abstract":"Let D be a finite simple directed graph with vertex set V(D) and arc set A(D). A function  is called a signed dominating function (SDF) if  for each vertex . The weight  of f is defined by . The signed domination number of a digraph D is . Let Cm × Cn denotes the cartesian product of directed cycles of length m and n. In this paper, we determine the exact values of gs(Cm × Cn) for m = 8, 9, 10 and arbitrary n. Also, we give the exact value of gs(Cm × Cn) when m,  (mod 3) and bounds for otherwise.","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":"24 1","pages":"54-64"},"PeriodicalIF":0.0000,"publicationDate":"2015-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"离散数学期刊(英文)","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.4236/OJDM.2015.53005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Let D be a finite simple directed graph with vertex set V(D) and arc set A(D). A function  is called a signed dominating function (SDF) if  for each vertex . The weight  of f is defined by . The signed domination number of a digraph D is . Let Cm × Cn denotes the cartesian product of directed cycles of length m and n. In this paper, we determine the exact values of gs(Cm × Cn) for m = 8, 9, 10 and arbitrary n. Also, we give the exact value of gs(Cm × Cn) when m,  (mod 3) and bounds for otherwise.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于两个有向环笛卡尔积的符号支配数
设D为具有顶点集V(D)和圆弧集a (D)的有限简单有向图。对于每个顶点,一个函数称为有符号支配函数(SDF)。f的权值定义为。有向图D的签名支配数为。设Cm × Cn为长度为m和n的有向环的笛卡儿积。本文确定了m = 8,9,10和任意n时gs(Cm × Cn)的精确值,并给出了m, (mod 3)时gs(Cm × Cn)的精确值和其他情况下的界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
127
期刊最新文献
Genome Sequencing Using Graph Theory Approach A Relationship between the Partial Bell Polynomials and Alternating Run Polynomials A Novel Design Method for Protein-Like Molecules from the Perspective of Sheaf Theory Solving the k-Independent Sets Problem of Graphs by Gröbner Bases Rupture Degree of Some Cartesian Product Graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1