图的最小支配集的消去性质

IF 0.5 4区数学 Q3 MATHEMATICS

Discussiones Mathematicae Graph Theory Pub Date : 2022-11-25 DOI:10.7151/dmgt.2354

Jaume Martí-Farré, M. Mora, M. L. Puertas, José Luis Ruiz

{"title":"图的最小支配集的消去性质","authors":"Jaume Martí-Farré, M. Mora, M. L. Puertas, José Luis Ruiz","doi":"10.7151/dmgt.2354","DOIUrl":null,"url":null,"abstract":"Abstract A dominating set of a graph is a vertex subset such that every vertex not in the subset is adjacent to at least one in the subset. In this paper we study whenever there exists a new dominating set contained (respectively, containing) the subset obtained by removing a common vertex from the union of two minimal dominating sets. A complete description of the graphs satisfying such elimination properties is provided.","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"43 1","pages":"137 - 149"},"PeriodicalIF":0.5000,"publicationDate":"2022-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Elimination Properties for Minimal Dominating Sets of Graphs\",\"authors\":\"Jaume Martí-Farré, M. Mora, M. L. Puertas, José Luis Ruiz\",\"doi\":\"10.7151/dmgt.2354\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract A dominating set of a graph is a vertex subset such that every vertex not in the subset is adjacent to at least one in the subset. In this paper we study whenever there exists a new dominating set contained (respectively, containing) the subset obtained by removing a common vertex from the union of two minimal dominating sets. A complete description of the graphs satisfying such elimination properties is provided.\",\"PeriodicalId\":48875,\"journal\":{\"name\":\"Discussiones Mathematicae Graph Theory\",\"volume\":\"43 1\",\"pages\":\"137 - 149\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2022-11-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discussiones Mathematicae Graph Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.7151/dmgt.2354\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discussiones Mathematicae Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.7151/dmgt.2354","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

图的支配集是一个顶点子集，使得不在子集中的每个顶点都与该子集中的至少一个相邻。在本文中，我们研究了当存在一个新的支配集时，它包含（分别包含）通过从两个最小支配集的并集中移除公共顶点而获得的子集。提供了满足这种消去性质的图的完整描述。

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

查看原文本刊更多论文

Elimination Properties for Minimal Dominating Sets of Graphs

Abstract A dominating set of a graph is a vertex subset such that every vertex not in the subset is adjacent to at least one in the subset. In this paper we study whenever there exists a new dominating set contained (respectively, containing) the subset obtained by removing a common vertex from the union of two minimal dominating sets. A complete description of the graphs satisfying such elimination properties is provided.

求助全文

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

来源期刊

Discussiones Mathematicae Graph Theory MATHEMATICS-

CiteScore

2.20

自引率

0.00%

发文量

审稿时长

53 weeks

期刊介绍： The Discussiones Mathematicae Graph Theory publishes high-quality refereed original papers. Occasionally, very authoritative expository survey articles and notes of exceptional value can be published. The journal is mainly devoted to the following topics in Graph Theory: colourings, partitions (general colourings), hereditary properties, independence and domination, structures in graphs (sets, paths, cycles, etc.), local properties, products of graphs as well as graph algorithms related to these topics.