盆栽图中最大解离集的最大数目

IF 3.4 2区数学 Q1 MATHEMATICS, APPLIED

Applied Mathematics and Computation Pub Date : 2025-07-08 DOI:10.1016/j.amc.2025.129618

Zejun Huang, Xinwei Zhang

{"title":"盆栽图中最大解离集的最大数目","authors":"Zejun Huang, Xinwei Zhang","doi":"10.1016/j.amc.2025.129618","DOIUrl":null,"url":null,"abstract":"<div><div>A potted graph is a unicyclic graph such that its cycle contains a unique vertex with degree larger than 2. Given a graph <em>G</em>, a subset of <span><math><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> is a dissociation set of <em>G</em> if it induces a subgraph with maximum degree at most one. A maximum dissociation set is a dissociation set with maximum cardinality. In this paper, we determine the maximum number of maximum dissociation sets in a potted graph of order <em>n</em> which contains a fixed cycle. The corresponding extremal graphs are also characterized.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"508 ","pages":"Article 129618"},"PeriodicalIF":3.4000,"publicationDate":"2025-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The maximum number of maximum dissociation sets in potted graphs\",\"authors\":\"Zejun Huang, Xinwei Zhang\",\"doi\":\"10.1016/j.amc.2025.129618\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>A potted graph is a unicyclic graph such that its cycle contains a unique vertex with degree larger than 2. Given a graph <em>G</em>, a subset of <span><math><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> is a dissociation set of <em>G</em> if it induces a subgraph with maximum degree at most one. A maximum dissociation set is a dissociation set with maximum cardinality. In this paper, we determine the maximum number of maximum dissociation sets in a potted graph of order <em>n</em> which contains a fixed cycle. The corresponding extremal graphs are also characterized.</div></div>\",\"PeriodicalId\":55496,\"journal\":{\"name\":\"Applied Mathematics and Computation\",\"volume\":\"508 \",\"pages\":\"Article 129618\"},\"PeriodicalIF\":3.4000,\"publicationDate\":\"2025-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Mathematics and Computation\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0096300325003443\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Mathematics and Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0096300325003443","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

壶形图是一种单环图，它的循环包含一个唯一的顶点，且顶点的度数大于2。给定一个图G，如果V(G)的子集诱导出最大度不超过1的子图，则它是G的解离集。最大解离集是具有最大基数的解离集。本文确定了包含一个固定循环的n阶容器图中最大解离集的最大数目。并对相应的极值图进行了刻画。

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

查看原文本刊更多论文

The maximum number of maximum dissociation sets in potted graphs

A potted graph is a unicyclic graph such that its cycle contains a unique vertex with degree larger than 2. Given a graph G, a subset of

V (G)

is a dissociation set of G if it induces a subgraph with maximum degree at most one. A maximum dissociation set is a dissociation set with maximum cardinality. In this paper, we determine the maximum number of maximum dissociation sets in a potted graph of order n which contains a fixed cycle. The corresponding extremal graphs are also characterized.

求助全文

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

来源期刊

Applied Mathematics and Computation 数学-应用数学

CiteScore

7.90

自引率

10.00%

发文量

755

审稿时长

36 days

期刊介绍： Applied Mathematics and Computation addresses work at the interface between applied mathematics, numerical computation, and applications of systems – oriented ideas to the physical, biological, social, and behavioral sciences, and emphasizes papers of a computational nature focusing on new algorithms, their analysis and numerical results. In addition to presenting research papers, Applied Mathematics and Computation publishes review articles and single–topics issues.