关于某些图积中 k-independence 的复杂性结果

RAIRO - Operations Research Pub Date : 2024-05-07 DOI:10.1051/ro/2024098

Márcia Cappelle, Erika Coelho, Otavio Mortosa, Julliano Nascimento

{"title":"关于某些图积中 k-independence 的复杂性结果","authors":"Márcia Cappelle, Erika Coelho, Otavio Mortosa, Julliano Nascimento","doi":"10.1051/ro/2024098","DOIUrl":null,"url":null,"abstract":"For a positive integer k, a subset S of vertices of a graph G=(V,E) is k-independent if each vertex in S has at most k - 1 neighbors in S. We consider k-independent sets in two graph products: Cartesian and complementary prism. We show that k-independence remains NP-complete even for Cartesian products and complementary prisms. Furthermore, we present results on k-independence in grid graphs, which is a Cartesian product of two paths.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"106 3","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Complexity results on k-independence in some graph products\",\"authors\":\"Márcia Cappelle, Erika Coelho, Otavio Mortosa, Julliano Nascimento\",\"doi\":\"10.1051/ro/2024098\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For a positive integer k, a subset S of vertices of a graph G=(V,E) is k-independent if each vertex in S has at most k - 1 neighbors in S. We consider k-independent sets in two graph products: Cartesian and complementary prism. We show that k-independence remains NP-complete even for Cartesian products and complementary prisms. Furthermore, we present results on k-independence in grid graphs, which is a Cartesian product of two paths.\",\"PeriodicalId\":506995,\"journal\":{\"name\":\"RAIRO - Operations Research\",\"volume\":\"106 3\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-05-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"RAIRO - Operations Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1051/ro/2024098\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"RAIRO - Operations Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/ro/2024098","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

对于正整数 k，如果 S 中的每个顶点在 S 中最多有 k - 1 个相邻顶点，则图 G=(V,E)的顶点子集 S 是 k-independent 的：笛卡尔图和互补棱镜图。我们证明，即使对于笛卡尔积和互补棱图，k-independence 仍然是 NP-complete。此外，我们还介绍了网格图中的 k-independence 结果，网格图是两条路径的笛卡尔积。

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

查看原文

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

本刊更多论文

Complexity results on k-independence in some graph products

For a positive integer k, a subset S of vertices of a graph G=(V,E) is k-independent if each vertex in S has at most k - 1 neighbors in S. We consider k-independent sets in two graph products: Cartesian and complementary prism. We show that k-independence remains NP-complete even for Cartesian products and complementary prisms. Furthermore, we present results on k-independence in grid graphs, which is a Cartesian product of two paths.

求助全文

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

来源期刊

RAIRO - Operations Research

自引率

0.00%

发文量