General Sum-Connectivity Index with α ≥ 1 for Trees and Unicyclic Graphs with k Pendants

被引：5
|
作者：
Tache, Rozica-Maria [1 ]
Tomescu, Ioan [1 ]
机构：
[1] Univ Bucharest, Fac Math & Comp Sci, Bucharest, Romania
来源：
2015 17TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC) | 2016年
关键词：
general sum-connectivity index; pendant vertex; tree; unicyclic graph;
D O I：
10.1109/SYNASC.2015.55
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
One of the newest molecular descriptors, the general sum-connectivity index of a graph G is defined as chi(alpha) (G) = Sigma(uv is an element of E(G))(d(u) + d(v))(alpha), where d(u) denotes the degree of vertex u in G and alpha is a real number. The aim of this paper is to determine the trees and the unicyclic graphs with k pendant vertices that maximize the general sum-connectivity index for alpha >= 1, with 2 <= k < n for trees and 0 <= k <= n - 3 for unicyclic graphs.
引用
收藏
页码：307 / 311
页数：5
相关论文
共 50 条
12345