在k连通图中的(t, k)-粉碎机上

Ars Comb. Pub Date : 2007-04-01 DOI:10.55937/sut/1252510544

Zeev Nutov, M. Tsugaki

{"title":"在k连通图中的(t, k)-粉碎机上","authors":"Zeev Nutov, M. Tsugaki","doi":"10.55937/sut/1252510544","DOIUrl":null,"url":null,"abstract":"Let G = (V, E) be a k-connected graph. For t >= 3 a subset T subset of V is a (t, k)-shredder if vertical bar T vertical bar = k and G - T has at least t connected components. It is known that the number of (t, k)-shredders in a k-connected graph on n nodes is less than 2n/(2t - 3). We show a slightly better bound for the case k <= 2t - 3.","PeriodicalId":378960,"journal":{"name":"Ars Comb.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"On (t, k)-shredders in k-connected graphs\",\"authors\":\"Zeev Nutov, M. Tsugaki\",\"doi\":\"10.55937/sut/1252510544\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G = (V, E) be a k-connected graph. For t >= 3 a subset T subset of V is a (t, k)-shredder if vertical bar T vertical bar = k and G - T has at least t connected components. It is known that the number of (t, k)-shredders in a k-connected graph on n nodes is less than 2n/(2t - 3). We show a slightly better bound for the case k <= 2t - 3.\",\"PeriodicalId\":378960,\"journal\":{\"name\":\"Ars Comb.\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ars Comb.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.55937/sut/1252510544\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ars Comb.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.55937/sut/1252510544","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

设G = (V, E)为k连通图。对于t >= 3 V的子集t是一个(t, k)-碎纸机，如果竖条t竖条= k且G - t至少有t个连通的分量。众所周知，在n个节点上的k连通图中(t, k)个碎纸机的数量小于2n/(2t - 3)。对于k <= 2t - 3的情况，我们给出了一个稍微更好的边界。

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

查看原文本刊更多论文

On (t, k)-shredders in k-connected graphs

Let G = (V, E) be a k-connected graph. For t >= 3 a subset T subset of V is a (t, k)-shredder if vertical bar T vertical bar = k and G - T has at least t connected components. It is known that the number of (t, k)-shredders in a k-connected graph on n nodes is less than 2n/(2t - 3). We show a slightly better bound for the case k <= 2t - 3.

求助全文

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

来源期刊

Ars Comb.

自引率

0.00%

发文量