SHARP BOUNDS FOR THE GENERAL RANDIC INDEX OF TREES WITH GIVEN DEGREE SEQUENCES

被引：0
|
作者：
Su, Guifu [1 ]
Rao, Gang [1 ]
机构：
[1] Beijing Univ Chem Technol, Coll Math & Phys, Beijing 100029, Peoples R China
来源：
ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS | 2020年 / 23卷 / 01期
关键词：
degree sequence; the general Rancho index; extremal graphs; tree; 2ND ZAGREB INDEXES; UNICYCLIC GRAPHS;
D O I：
10.17654/DM023010025
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The general Rancho index R-alpha(G) of a graph G is equal to the sum of the weights [d(u)d(v)](alpha) of all edges try in it, where d(u) denotes the degree of a vertex u in G and alpha is an arbitrary real number. In this paper, we completely characterize the unique extremal tree with the maximum general Rancho index in the class of all trees with a given degree sequence.
引用
收藏
页码：25 / 38
页数：14
相关论文
共 50 条
12345