Cristina Bazgan , Pinar Heggernes , André Nichterlein , Thomas Pontoizeau
{"title":"关于分割图上s-clubs周围问题的硬度","authors":"Cristina Bazgan , Pinar Heggernes , André Nichterlein , Thomas Pontoizeau","doi":"10.1016/j.dam.2025.01.023","DOIUrl":null,"url":null,"abstract":"<div><div>We investigate the complexity of problems related to <span><math><mi>s</mi></math></span>-clubs. Given a graph, an <span><math><mi>s</mi></math></span>-club is a subset of vertices such that the subgraph induced by it has diameter at most <span><math><mi>s</mi></math></span>. We show that partitioning a split graph into two 2-clubs is NP-hard. Moreover, we prove that finding the minimum number of edges to add to a split graph in order to obtain a diameter of at most 2 is W[2]-hard with respect to the number of edges to add. Finally we show that finding the minimum number of edges to keep within a split graph of diameter 2 or 3 in order to maintain its diameter is NP-complete.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"364 ","pages":"Pages 247-254"},"PeriodicalIF":1.1000,"publicationDate":"2025-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the hardness of problems around s-clubs on split graphs\",\"authors\":\"Cristina Bazgan , Pinar Heggernes , André Nichterlein , Thomas Pontoizeau\",\"doi\":\"10.1016/j.dam.2025.01.023\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>We investigate the complexity of problems related to <span><math><mi>s</mi></math></span>-clubs. Given a graph, an <span><math><mi>s</mi></math></span>-club is a subset of vertices such that the subgraph induced by it has diameter at most <span><math><mi>s</mi></math></span>. We show that partitioning a split graph into two 2-clubs is NP-hard. Moreover, we prove that finding the minimum number of edges to add to a split graph in order to obtain a diameter of at most 2 is W[2]-hard with respect to the number of edges to add. Finally we show that finding the minimum number of edges to keep within a split graph of diameter 2 or 3 in order to maintain its diameter is NP-complete.</div></div>\",\"PeriodicalId\":50573,\"journal\":{\"name\":\"Discrete Applied Mathematics\",\"volume\":\"364 \",\"pages\":\"Pages 247-254\"},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2025-03-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Applied Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0166218X25000290\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2025/1/24 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X25000290","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/24 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
On the hardness of problems around s-clubs on split graphs
We investigate the complexity of problems related to -clubs. Given a graph, an -club is a subset of vertices such that the subgraph induced by it has diameter at most . We show that partitioning a split graph into two 2-clubs is NP-hard. Moreover, we prove that finding the minimum number of edges to add to a split graph in order to obtain a diameter of at most 2 is W[2]-hard with respect to the number of edges to add. Finally we show that finding the minimum number of edges to keep within a split graph of diameter 2 or 3 in order to maintain its diameter is NP-complete.
期刊介绍：
The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal.
Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
