...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Hormone molecular biology and clinical investigation. >Sufficient Conditions for Maximally Edge-Connected and Super-Edge-Connected Graphs Depending on The Clique Number
【24h】

Sufficient Conditions for Maximally Edge-Connected and Super-Edge-Connected Graphs Depending on The Clique Number

机译：为最大限度地Edge-Connected充分条件和Super-Edge-Connected图根据集团号

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Let G be a connected graph with minimum degree δ and edge-connectivity λ. A graph is maximally edge-connected if λ = δ, and it is super-edgeconnected if every minimum edge-cut is trivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree. The clique number ω(G) of a graph G is the maximum cardinality of a complete subgraph of G. In this paper, we show that a connected graph G with clique number ω(G) ≤ r is maximally edge-connected or super-edge-connected if the number of edges is large enough. These are generalizations of corresponding results for triangle-free graphs by Volkmann and Hong in 2017.
机译：让最低度δG是一个连通图和edgeλ。edge-connected如果λ=δ,它是如果每一个最小edge-cut super-edgeconnected琐碎的;由边缘事件的顶点最低程度。G是一个完整的最大基数子图g的这篇文章中,我们证明连通图G集团ω数量≤r (G)最大限度edge-connected或super-edge-connected边的数量是否足够大。相应结果的推广triangle-free图福和香港2017.

著录项

相似文献

  • 外文文献
  • 中文文献
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号