关于Harary图中2-元组全支配问题的一个注记

2016 International Computer Symposium (ICS) Pub Date : 2016-12-01 DOI:10.1109/ICS.2016.0022

Si-Han Yang, Hung-Lung Wang

{"title":"关于Harary图中2-元组全支配问题的一个注记","authors":"Si-Han Yang, Hung-Lung Wang","doi":"10.1109/ICS.2016.0022","DOIUrl":null,"url":null,"abstract":"Let G be a graph with minimum degree at least 2. A vertex subset S is a 2-tuple total dominating set of G if every vertex is adjacent to at least two vertices in S. The 2-tuple total domination number of G is the minimum size of a 2-tuple total dominating set. In this paper, we are concerned with the 2-tuple total domination number of a Harary graph H2m+1, 2n+1 with 2n+1 = (2m+1)l. For m = 1 and m = 2, we show that the numbers are 2l and 2l+1, respectively.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Note on the 2-Tuple Total Domination Problem in Harary Graphs\",\"authors\":\"Si-Han Yang, Hung-Lung Wang\",\"doi\":\"10.1109/ICS.2016.0022\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G be a graph with minimum degree at least 2. A vertex subset S is a 2-tuple total dominating set of G if every vertex is adjacent to at least two vertices in S. The 2-tuple total domination number of G is the minimum size of a 2-tuple total dominating set. In this paper, we are concerned with the 2-tuple total domination number of a Harary graph H2m+1, 2n+1 with 2n+1 = (2m+1)l. For m = 1 and m = 2, we show that the numbers are 2l and 2l+1, respectively.\",\"PeriodicalId\":281088,\"journal\":{\"name\":\"2016 International Computer Symposium (ICS)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Computer Symposium (ICS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICS.2016.0022\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Computer Symposium (ICS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICS.2016.0022","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

设G是最小度至少为2的图。如果每个顶点都与S中的至少两个顶点相邻，则顶点子集S是G的2元组总支配集。G的2元组总支配数是2元组总支配集的最小大小。本文研究了一类H2m+ 1,2n +1图(2n+1 = (2m+1)l)的2元组总支配数。对于m = 1和m = 2，我们分别表示数字为2l和2l+1。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A Note on the 2-Tuple Total Domination Problem in Harary Graphs

Let G be a graph with minimum degree at least 2. A vertex subset S is a 2-tuple total dominating set of G if every vertex is adjacent to at least two vertices in S. The 2-tuple total domination number of G is the minimum size of a 2-tuple total dominating set. In this paper, we are concerned with the 2-tuple total domination number of a Harary graph H2m+1, 2n+1 with 2n+1 = (2m+1)l. For m = 1 and m = 2, we show that the numbers are 2l and 2l+1, respectively.

求助全文

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

来源期刊

2016 International Computer Symposium (ICS)

自引率

0.00%

发文量