华东师范大学学报(自然科学版) ›› 2006, Vol. 2006 ›› Issue (5): 83-85.

• 数学 统计学 • 上一篇    下一篇

变换图G+--的极大边连通性(英)

陈金阳, 孟吉翔   

  1. 新疆大学 数学与系统科学学院, 乌鲁木齐 830046
  • 收稿日期:2005-05-08 修回日期:2005-10-10 发布日期:2006-09-25
  • 通讯作者: 陈金阳

Maximally Edge-Connectivity of a Transformation Graph G+--(English)

CHEN Jin-yang, MENG Ji-xiang   

  1. Institute of Mathematics and System Sciences, Xinjiang University, Urumqi 830046, China
  • Received:2005-05-08 Revised:2005-10-10 Published:2006-09-25
  • Contact: CHEN Jin-yang

摘要： 证明了对于任意的图G, 其变换图G+--,是极大边连通的当且仅当G至少有两条边且不同构于2K2.

关键词: 变换图, 边连通性, 极大边连通性, 变换图, 边连通性, 极大边连通性

Abstract: This paper proved that for any graph G, its transformation graph G+-- is maximally edge-connected if and only if G has at least two edges and G ～≠ 2K2.

Key words: edge-connectivity, maximally edge-connectivity, transformation graphs, edge-connectivity, maximally edge-connectivity

中图分类号: