{"title":"Remarks on Cut-Sets","authors":"J. Grossman","doi":"10.6028/JRES.071B.025","DOIUrl":null,"url":null,"abstract":"This paper gives a theore m on combinations of segs in a finite, connec ted , undirected graph. The n the theore m is specialized to combinations of cut sets, giving a theore m first pro ven by Ma yeda. The paper contains an example showing that modifiers added to Ma yeda' s theore m by Yau , in the Journal of th e Franklin Institute, Janu ary 1962, yield a fal se theorem. Finally, the pa pe r discusses the prac· ticability of algorithms de veloped by Mayeda and Yau and based on Mayeda's theore m.","PeriodicalId":408709,"journal":{"name":"Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics","volume":"28 8","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1967-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.6028/JRES.071B.025","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper gives a theore m on combinations of segs in a finite, connec ted , undirected graph. The n the theore m is specialized to combinations of cut sets, giving a theore m first pro ven by Ma yeda. The paper contains an example showing that modifiers added to Ma yeda' s theore m by Yau , in the Journal of th e Franklin Institute, Janu ary 1962, yield a fal se theorem. Finally, the pa pe r discusses the prac· ticability of algorithms de veloped by Mayeda and Yau and based on Mayeda's theore m.