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

被引：0
|
作者：
Chen, Jingjing [2 ]
Li, Shuchao [1 ]
机构：
[1] Cent China Normal Univ, Fac Math & Stat, Wuhan 430079, Peoples R China
[2] Wuhan Text Univ, Coll Math & Comp Sci, Wuhan 430074, Peoples R China
来源：
MATHEMATICAL COMMUNICATIONS | 2011年 / 16卷 / 02期
基金：
美国国家科学基金会;
关键词：
Randic connectivity index; sum-connectivity index; unicyclic graph; pendent vertices;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The sum-connectivity index R'(G) of a graph G is the sum of the weights (d(u) + d(v))(-1/2) of 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. Trinajstic, 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.
引用
收藏
页码：359 / 368
页数：10
相关论文
共 50 条
12345