图形中的反向双重支配

Q3 Engineering

推进技术 Pub Date : 2024-07-04 DOI:10.52783/tjjpt.v45.i03.7347

Vinodh Kumar

{"title":"图形中的反向双重支配","authors":"Vinodh Kumar","doi":"10.52783/tjjpt.v45.i03.7347","DOIUrl":null,"url":null,"abstract":"A vertex set is a double – dominating set, if each vertex is adjacent to at least two vertices in . The minimum cardinality of a double dominating set of G, denoted by is called the double domination number of G.\nA double dominating set S of a graph is an inverse double dominating set, if contains a double dominating set say of . Then is called an inverse double dominating set. The inverse double domination number of is the minimum cardinality of an inverse double dominating set.\nIn this paper, we obtain exact value of for some standard graphs and also, we establish some general results on this parameters.\nDOI: https://doi.org/10.52783/tjjpt.v45.i03.7347","PeriodicalId":39883,"journal":{"name":"推进技术","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Inverse Double Domination in Graphs\",\"authors\":\"Vinodh Kumar\",\"doi\":\"10.52783/tjjpt.v45.i03.7347\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A vertex set is a double – dominating set, if each vertex is adjacent to at least two vertices in . The minimum cardinality of a double dominating set of G, denoted by is called the double domination number of G.\\nA double dominating set S of a graph is an inverse double dominating set, if contains a double dominating set say of . Then is called an inverse double dominating set. The inverse double domination number of is the minimum cardinality of an inverse double dominating set.\\nIn this paper, we obtain exact value of for some standard graphs and also, we establish some general results on this parameters.\\nDOI: https://doi.org/10.52783/tjjpt.v45.i03.7347\",\"PeriodicalId\":39883,\"journal\":{\"name\":\"推进技术\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"推进技术\",\"FirstCategoryId\":\"1087\",\"ListUrlMain\":\"https://doi.org/10.52783/tjjpt.v45.i03.7347\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"推进技术","FirstCategoryId":"1087","ListUrlMain":"https://doi.org/10.52783/tjjpt.v45.i03.7347","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}

引用次数: 0

摘要

如果每个顶点都至少与 .G 中的两个顶点相邻，则该顶点集为双支配集。如果一个图的双支配集 S 包含一个双支配集，即 S 的双支配集，则称为逆双支配集。本文中，我们获得了一些标准图的反向双支配集的精确值，并建立了一些关于该参数的一般结果。DOI: https://doi.org/10.52783/tjjpt.v45.i03.7347

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

查看原文本刊更多论文

Inverse Double Domination in Graphs

A vertex set is a double – dominating set, if each vertex is adjacent to at least two vertices in . The minimum cardinality of a double dominating set of G, denoted by is called the double domination number of G. A double dominating set S of a graph is an inverse double dominating set, if contains a double dominating set say of . Then is called an inverse double dominating set. The inverse double domination number of is the minimum cardinality of an inverse double dominating set. In this paper, we obtain exact value of for some standard graphs and also, we establish some general results on this parameters. DOI: https://doi.org/10.52783/tjjpt.v45.i03.7347

求助全文

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

来源期刊

推进技术 Engineering-Aerospace Engineering

CiteScore

1.40

自引率

0.00%

发文量

6610

期刊介绍：