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 条
[21]   On general sum-connectivity index [J].
Zhou, Bo ;
Trinajstic, Nenad .
JOURNAL OF MATHEMATICAL CHEMISTRY, 2010, 47 (01) :210-218
[22]   The Minimum General Sum-Connectivity Index of Trees with Given Matching Number [J].
Zhong, Lingping ;
Qian, Qiuping .
BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2020, 43 (02) :1527-1544
[23]   On the general sum-connectivity index of connected graphs with given order and girth [J].
Tomescu, Joan .
ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2016, 4 (01) :1-7
[24]   On the maximum atom-bond sum-connectivity index of unicyclic graphs with given diameter [J].
Wang, Zhen ;
Zhou, Kai .
AIMS MATHEMATICS, 2024, 9 (08) :22239-22250
[25]   Minimum atom-bond sum-connectivity index of unicyclic graphs with maximum degree [J].
Nithya, Palaniyappan ;
Elumalai, Suresh ;
Balachandran, Selvaraj .
DISCRETE MATHEMATICS LETTERS, 2024, 13 :82-88
[26]   MAXIMUM GENERAL SUM-CONNECTIVITY INDEX WITH-1 ≤ α < 0 FOR BICYCLIC GRAPHS [J].
Arshad, Misbah ;
Tomescu, Ioan .
MATHEMATICAL REPORTS, 2017, 19 (01) :93-96
[27]   Progress in General Sum-Connectivity Index [J].
Peng Shuying .
2011 INTERNATIONAL CONFERENCE ON ELECTRONICS, COMMUNICATIONS AND CONTROL (ICECC), 2011, :2185-2188
[28]   The sharp bounds on general sum-connectivity index of four operations on graphs [J].
Akhter, Shehnaz ;
Imran, Muhammad .
JOURNAL OF INEQUALITIES AND APPLICATIONS, 2016,
[29]   Two-tree graphs with maximum general sum-connectivity index [J].
Khoeilar, R. ;
Shooshtari, H. .
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2021, 13 (03)
[30]   On the extremal graphs for general sum-connectivity index (χα) with given cyclomatic number when α > 1 [J].
Ali, Akbar ;
Dimitrov, Darko ;
Du, Zhibin ;
Ishfaq, Faiza .
DISCRETE APPLIED MATHEMATICS, 2019, 257 :19-30