{"title":"9连通图中的9个碎纸机","authors":"Naoki Hirata","doi":"10.55937/sut/1298557742","DOIUrl":null,"url":null,"abstract":". For a graph G , a subset S of V ( G ) is called a shredder if G − S consists of three or more components. We show that if G is a 9-connected graph of order at least 67, then the number of shredders of cardinality 9 of G is less than or equal to (2 | V ( G ) | − 9) / 3.","PeriodicalId":38708,"journal":{"name":"SUT Journal of Mathematics","volume":"14 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2010-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"9-Shredders in 9-connected graphs\",\"authors\":\"Naoki Hirata\",\"doi\":\"10.55937/sut/1298557742\",\"DOIUrl\":null,\"url\":null,\"abstract\":\". For a graph G , a subset S of V ( G ) is called a shredder if G − S consists of three or more components. We show that if G is a 9-connected graph of order at least 67, then the number of shredders of cardinality 9 of G is less than or equal to (2 | V ( G ) | − 9) / 3.\",\"PeriodicalId\":38708,\"journal\":{\"name\":\"SUT Journal of Mathematics\",\"volume\":\"14 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SUT Journal of Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.55937/sut/1298557742\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SUT Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.55937/sut/1298557742","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0
摘要
。对于图G，如果G−S包含三个或三个以上的分量，则V (G)的子集S称为碎纸机。我们证明了如果G是一个阶数至少为67的9连通图，那么G的基数9的切分器的个数小于或等于(2 | V (G) |−9)/ 3。
. For a graph G , a subset S of V ( G ) is called a shredder if G − S consists of three or more components. We show that if G is a 9-connected graph of order at least 67, then the number of shredders of cardinality 9 of G is less than or equal to (2 | V ( G ) | − 9) / 3.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
