Maximally edge-connected graphs and Zeroth-order general Randi膰 index for

详细信息    查看全文

• 作者：Guifu Su^a ; ^{gfs1983@126.com" class="auth_mail} ; ^{gfs86@uga.edu" class="auth_mail} ; Liming Xiong^a ; ^{lmxiong@bit.edu.cn" class="auth_mail} ; Xiaofeng Su^b ; ^{umpire.su@gmail.com" class="auth_mail}
• 关键词：Degree (of vertex) ; Zeroth-order general Randi膰 index ; Edge-connectivity ; Maximally edge-connected
• 刊名：Discrete Applied Mathematics
• 出版年：20 April, 2014
• 年：2014
• 卷：167
• 期：Complete
• 页码：261-268
• 全文大小：386 K

文摘

Let be a connected graph with order , minimum degree and edge-connectivity . A graph is said to be maximally edge-connected if . In this paper, we present two sufficient conditions for (triangle-free) graphs to be maximally edge-connected in terms of its order and the Zeroth-order general Randi膰 index.