版权说明 操作指南
首页 > 成果 > 详情

On the sum-connectivity index of unicyclic graphs with k pendent vertices

认领
导出
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Chen, Jingjing;Li, Shuchao*
通讯作者:
Li, Shuchao
作者机构:
[Chen, Jingjing] Wuhan Text Univ, Coll Math & Comp Sci, Wuhan 430074, Peoples R China.
[Li, Shuchao] Cent China Normal Univ, Fac Math & Stat, Wuhan 430079, Peoples R China.
通讯机构:
[Li, Shuchao] C
Cent China Normal Univ, Fac Math & Stat, Wuhan 430079, Peoples R China.
语种:
英文
关键词:
Randić connectivity index;sum-connectivity index;unicyclic graph;pendent vertices
期刊:
MATHEMATICAL COMMUNICATIONS
ISSN:
1331-0623
年:
2011
卷:
16
期:
2
页码:
359-368
基金类别:
CCNU [CCNUO9Y01005, CCNUO9Y01018]; MOEMinistry of Higher Education & Scientific Research (MHESR); National Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [11071096]
机构署名:
本校为通讯机构
院系归属:
数学与统计学学院
摘要:
The sum-connectivity index R'(G) of a graph G is the sum of the weights (d u + d v) -1/2of all edges uv of G, where d u and d v are the degrees of the vertices u and v in G. This index was recently introduced in [B. Zhou, N. Trinajstić, On a novel connectivity index, J. Math. Chem. 46(2009), 1252-1270]. In this paper, we give the sharp lower bound of the sum-connectivity index of n-vertex unicyclic graphs with k pendent vertices. © 201...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com