关于网格图的签名支配

离散数学期刊(英文) Pub Date : 2020-09-16 DOI:10.4236/ojdm.2020.104010

M. Hassan, Muhsin Al Hassan, Mazen Mostafa

{"title":"关于网格图的签名支配","authors":"M. Hassan, Muhsin Al Hassan, Mazen Mostafa","doi":"10.4236/ojdm.2020.104010","DOIUrl":null,"url":null,"abstract":"Let G(V, E) be a finite connected simple graph with vertex set V(G). A function is a signed dominating function f : V(G)→{−1,1} if for every vertex v ∈ V(G), the sum of closed neighborhood weights of v is greater or equal to 1. The signed domination number γs(G) of G is the minimum weight of a signed dominating function on G. In this paper, we calculate the signed domination numbers of the Cartesian product of two paths Pm and Pn for m = 6, 7 and arbitrary n.","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Signed Domination of Grid Graph\",\"authors\":\"M. Hassan, Muhsin Al Hassan, Mazen Mostafa\",\"doi\":\"10.4236/ojdm.2020.104010\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G(V, E) be a finite connected simple graph with vertex set V(G). A function is a signed dominating function f : V(G)→{−1,1} if for every vertex v ∈ V(G), the sum of closed neighborhood weights of v is greater or equal to 1. The signed domination number γs(G) of G is the minimum weight of a signed dominating function on G. In this paper, we calculate the signed domination numbers of the Cartesian product of two paths Pm and Pn for m = 6, 7 and arbitrary n.\",\"PeriodicalId\":61712,\"journal\":{\"name\":\"离散数学期刊(英文)\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"离散数学期刊(英文)\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.4236/ojdm.2020.104010\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"离散数学期刊(英文)","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.4236/ojdm.2020.104010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

设G(V, E)为顶点集V(G)的有限连通简单图。一个函数是一个有符号支配函数f: V(G)→{−1,1}，如果对于每个顶点V∈V(G)， V的闭邻权值之和大于等于1。G的有符号支配数γs(G)是G上有符号支配函数的最小权值。本文计算了m = 6,7和任意n时两条路径Pm和Pn的笛卡尔积的有符号支配数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On Signed Domination of Grid Graph

Let G(V, E) be a finite connected simple graph with vertex set V(G). A function is a signed dominating function f : V(G)→{−1,1} if for every vertex v ∈ V(G), the sum of closed neighborhood weights of v is greater or equal to 1. The signed domination number γs(G) of G is the minimum weight of a signed dominating function on G. In this paper, we calculate the signed domination numbers of the Cartesian product of two paths Pm and Pn for m = 6, 7 and arbitrary n.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

离散数学期刊(英文)

自引率

0.00%

发文量

127