Möbius梯子数量

ITM Web of Conferences Pub Date : 1900-01-01 DOI:10.1051/ITMCONF/20192501013

Yijin Wang, Xinyue Zhang, Sijia Zhang

{"title":"Möbius梯子数量","authors":"Yijin Wang, Xinyue Zhang, Sijia Zhang","doi":"10.1051/ITMCONF/20192501013","DOIUrl":null,"url":null,"abstract":"A subset F ⊂ V(G) is called a feedback vertex set if the subgraph G−F is acyclic. The minimum cardinality of a feedback vertex set is called the feedback number of G, which is proposed by Beineke and Vandell [1]. In this paper, we consider a particular topology graph called Möbius ladders M2n. We use f(M2n) to denote the feedback number of M2n. This paper proves that f (M2n) = [n+1/2], n≥3.","PeriodicalId":433898,"journal":{"name":"ITM Web of Conferences","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Feedback Numbers of Möbius Ladders\",\"authors\":\"Yijin Wang, Xinyue Zhang, Sijia Zhang\",\"doi\":\"10.1051/ITMCONF/20192501013\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A subset F ⊂ V(G) is called a feedback vertex set if the subgraph G−F is acyclic. The minimum cardinality of a feedback vertex set is called the feedback number of G, which is proposed by Beineke and Vandell [1]. In this paper, we consider a particular topology graph called Möbius ladders M2n. We use f(M2n) to denote the feedback number of M2n. This paper proves that f (M2n) = [n+1/2], n≥3.\",\"PeriodicalId\":433898,\"journal\":{\"name\":\"ITM Web of Conferences\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ITM Web of Conferences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1051/ITMCONF/20192501013\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ITM Web of Conferences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/ITMCONF/20192501013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

如果子图G−F是无环的，则子图F∧V(G)称为反馈顶点集。反馈顶点集的最小基数称为反馈数G，由Beineke和Vandell[1]提出。在本文中，我们考虑一个特殊的拓扑图，称为Möbius梯子M2n。我们用f(M2n)表示M2n的反馈数。证明了f (M2n) = [n+1/2]， n≥3。

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

查看原文本刊更多论文

Feedback Numbers of Möbius Ladders

A subset F ⊂ V(G) is called a feedback vertex set if the subgraph G−F is acyclic. The minimum cardinality of a feedback vertex set is called the feedback number of G, which is proposed by Beineke and Vandell [1]. In this paper, we consider a particular topology graph called Möbius ladders M2n. We use f(M2n) to denote the feedback number of M2n. This paper proves that f (M2n) = [n+1/2], n≥3.

求助全文

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

来源期刊

ITM Web of Conferences

自引率

0.00%

发文量