{"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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于割集的说明
本文给出了有限连通无向图中segs组合的一个定理m。定理m专门化于切集的组合,给出了一个由马叶达首先证明的定理m。本文给出了一个例子,证明了丘成桐在1962年1月发表于《富兰克林研究所学报》上的马业大定理中加入的修饰语产生了一个假定理。最后,本文讨论了Mayeda和Yau基于Mayeda的理论开发的算法的实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A PSEUDO PRIMAL-DUAL INTEGER PROGRAMMING ALGORITHM. Systems of distinct representatives and linear algebra Remarks on Cut-Sets Partially isometric matrices Matrices of class J2
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1