排序方式: 共有1条查询结果,搜索用时 0 毫秒
1
1.
IntroductionLet G=(V,E) be a finite,simple and undi-rected graph with vertex set V and edge set E.We' ll follow the terminology and notation of Ref.[1 ]and terms not defined here can be found inRefs.[1 ,2 ].A set S of edges of G is called an edgedisconnecting set if G - S is disconnected. Theusual edge connectivityλ(G) of G is the minimumcardinality over the all edge disconnecting sets ofG.Note that,in the above definition,absolutelyno conditions or restrictions are imposed either onthe… 相似文献
1